Kameng Nip

25 papers A* 1C 3Misc 3Journal 17Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
When the lowest reference price shapes assortment competition: A multinomial logit framework.
Oper. Res. Lett.
Lili Wang, Kameng Nip, Min Li, Lianmin Zhang
2024 J jnl
Computational complexity and algorithms for two scheduling problems under linear constraints.
J. Comb. Optim.
Kameng Nip, Peng Xie
2024 A* conf
Duopoly Assortment Competition under the Multinomial Logit Model: Simultaneous vs. Sequential.
EC
Kameng Nip, Changjun Wang
2023 J jnl
A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints.
J. Sched.
Kameng Nip, Zhenbo Wang
2023 — conf
On the NP-Hardness of Two Scheduling Problems Under Linear Constraints.
IJTCS-FAW
Kameng Nip
2022 J jnl
Related machine scheduling with machine speeds satisfying linear constraints.
J. Comb. Optim.
Siyun Zhang, Kameng Nip, Zhenbo Wang
2022 J jnl
Some graph optimization problems with weights satisfying linear constraints.
J. Comb. Optim.
Kameng Nip, Tianning Shi, Zhenbo Wang
2021 J jnl
A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints.
INFORMS J. Comput.
Zeyang Wu, Kameng Nip, Qie He
2019 J jnl
On the approximability of the two-phase knapsack problem.
J. Comb. Optim.
Kameng Nip, Zhenbo Wang
2019 C conf
Some Graph Optimization Problems with Weights Satisfying Linear Constraints.
COCOA
Kameng Nip, Zhenbo Wang, Tianning Shi
2019 C conf
Two-Machine Flow Shop Scheduling Problem Under Linear Constraints.
COCOA
Kameng Nip, Zhenbo Wang
2018 Misc conf
Approximation Algorithms for a Two-Phase Knapsack Problem.
COCOON
Kameng Nip, Zhenbo Wang
2018 C conf
Related Machine Scheduling with Machine Speeds Satisfying Linear Constraints.
COCOA
Siyun Zhang, Kameng Nip, Zhenbo Wang
2017 J jnl
Assortment Optimization under a Single Transition Model.
CoRR
Kameng Nip, Zhenbo Wang, Zizhuo Wang
2017 J jnl
Bin packing under linear constraints.
J. Comb. Optim.
Zhenbo Wang, Kameng Nip
2017 J jnl
Knapsack with variable weights satisfying linear constraints.
J. Glob. Optim.
Kameng Nip, Zhenbo Wang, Zizhuo Wang
2016 J jnl
A study on several combination problems of classic shop scheduling and shortest path.
Theor. Comput. Sci.
Kameng Nip, Zhenbo Wang, Wenxun Xing
2016 J jnl
Scheduling under linear constraints.
Eur. J. Oper. Res.
Kameng Nip, Zhenbo Wang, Zizhuo Wang
2015 J jnl
A combination of flow shop scheduling and the shortest path problem.
J. Comb. Optim.
Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon, Roel Leus
2015 Misc conf
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms.
COCOON
Kameng Nip, Zhenbo Wang, Wenxun Xing
2015 J jnl
Resource loading with time windows.
Eur. J. Oper. Res.
Fabrice Talla Nobibon, Roel Leus, Kameng Nip, Zhenbo Wang
2015 J jnl
Scheduling under Linear Constraints.
CoRR
Kameng Nip, Zhenbo Wang, Zizhuo Wang
2013 J jnl
A Combination of Flow Shop Scheduling and the Shortest Path Problem.
CoRR
Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon, Roel Leus
2013 Misc conf
Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems.
COCOON
Kameng Nip, Zhenbo Wang
2013 J jnl
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms.
CoRR
Kameng Nip, Zhenbo Wang, Wenxun Xing