Similar Search Results

On-line service scheduling

Wang, Zhenbo; Xing, Wenxun; Chen, Bo - In: Journal of scheduling 12 (2009) 1, pp. 31-43

Persistent link: https://www.econbiz.de/10003832888

A successive approximation algorithm for the multiple knapsack problem

Wang, Zhenbo; Xing, Wenxun - In: Journal of combinatorial optimization 17 (2009) 4, pp. 347-366

Persistent link: https://www.econbiz.de/10003850757

A canonical dual approach for solving linearly constrained quadratic programs

Xing, Wenxun; Fang, Shu-Cherng; Sheu, Ruey-lin; Wang, Ziteng - In: European journal of operational research : EJOR 218 (2012) 1, pp. 21-27

Persistent link: https://www.econbiz.de/10009501073

A gradient descent based algorithm for ℓp minimization

Jiang, Shan; Fang, Shu-Cherng; Nie, Tiantian; Xing, Wenxun - In: European journal of operational research : EJOR 283 (2020) 1, pp. 47-56

Persistent link: https://www.econbiz.de/10012161918

Maximizing perturbation radii for robust convex quadratically constrained quadratic programs

Yu, Pengfei; Gao, Ruotian; Xing, Wenxun - In: European journal of operational research : EJOR 293 (2021) 1, pp. 50-64

Persistent link: https://www.econbiz.de/10012502488

Scheduling under linear constraints

Nip, Kameng; Wang, Zhenbo; Wang, Zizhuo - In: European journal of operational research : EJOR 253 (2016) 2, pp. 290-297

Persistent link: https://www.econbiz.de/10011490278

Resource loading with time windows

Talla Nobibon, Fabrice; Leus, Roel; Nip, Kameng; Wang, … - In: European journal of operational research : EJOR 244 (2015) 2, pp. 404-416

Persistent link: https://www.econbiz.de/10010531910

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints

Nip, Kameng; Wang, Zhenbo - In: Journal of scheduling : JOS 26 (2023) 6, pp. 543-558

Persistent link: https://www.econbiz.de/10014444325

Assortment Optimization Under a Single Transition Model

Nip, Kameng; Wang, Zhenbo; Wang, Zizhuo - 2020

In this paper, we consider a new customer choice model which we call the single transition choice model. In this model, there is a universe of products and customers arrive at each product with a certain probability. If the arrived product is unavailable, then the seller can recommend a subset...

Persistent link: https://www.econbiz.de/10014122905