Zhenbo Wang
Zhenbo Wang
Department of Mathematical Sciences, Tsinghua University
Verified email at math.tsinghua.edu.cn - Homepage
Title
Cited by
Cited by
Year
Canonical dual approach to solving the maximum cut problem
Z Wang, SC Fang, DY Gao, W Xing
Journal of Global Optimization 54, 341-351, 2012
512012
Global extremal conditions for multi-integer quadratic programming
Z Wang, SC Fang, DY Gao, W Xing
American Institute of Mathematical Sciences, 2008
462008
No-wait flexible flowshop scheduling with no-idle machines
Z Wang, W Xing, F Bai
Operations Research Letters 33 (6), 609-614, 2005
422005
KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
C Lu, SC Fang, Q Jin, Z Wang, W Xing
SIAM Journal on Optimization 21 (4), 1475-1490, 2011
352011
Network optimization
JX Xie, WX Xing, Z Wang
Tsinghua University Press, Beijing, 2000
252000
Two-group knapsack game
Z Wang, W Xing, SC Fang
Theoretical Computer Science 411 (7-9), 1094-1103, 2010
152010
A study on several combination problems of classic shop scheduling and shortest path
K Nip, Z Wang, W Xing
Theoretical Computer Science 654, 175-187, 2016
122016
Resource loading with time windows
FT Nobibon, R Leus, K Nip, Z Wang
European Journal of Operational Research 244 (2), 404-416, 2015
122015
Combination of parallel machine scheduling and vertex cover
Z Wang, Z Cui
Theoretical Computer Science 460, 10-15, 2012
122012
Scheduling under linear constraints
K Nip, Z Wang, Z Wang
European Journal of Operational Research 253 (2), 290-297, 2016
112016
Extended canonical duality and conic programming for solving 0-1 quadratic programming problems
C Lu, Z Wang, W Xing, SC Fang
Journal of Industrial & Management Optimization 6 (4), 779, 2010
102010
Two-person knapsack game
Z Wang, W Xing, SC Fang
Journal of Industrial and Management Optimization 6 (4), 847, 2010
92010
Combination of two-machine flow shop scheduling and shortest path problems
K Nip, Z Wang
International Computing and Combinatorics Conference, 680-687, 2013
72013
A general bin packing game: interest taken into account
Z Wang, X Han, G Dósa, Z Tuza
Algorithmica 80 (5), 1534-1555, 2018
62018
Bin packing game with an interest matrix
Z Wang, X Han, G Dósa, Z Tuza
International Computing and Combinatorics Conference, 57-69, 2015
62015
A successive approximation algorithm for the multiple knapsack problem
Z Wang, W Xing
Journal of combinatorial optimization 17 (4), 347-366, 2009
62009
On-line service scheduling
Z Wang, W Xing, B Chen
Journal of Scheduling 12 (1), 31-43, 2009
62009
Assortment optimization under a single transition model
K Nip, Z Wang, Z Wang
Available at SSRN 2916110, 2020
52020
Bin packing under linear constraints
Z Wang, K Nip
Journal of Combinatorial Optimization 34 (4), 1198-1209, 2017
52017
Knapsack with variable weights satisfying linear constraints
K Nip, Z Wang, Z Wang
Journal of Global Optimization 69 (3), 713-725, 2017
42017
The system can't perform the operation now. Try again later.
Articles 1–20