个人简介
博士（清华大学，2006），副教授
工作履历
2009-现在，清华大学数学科学系，副教授
2008-2009，清华大学数学科学系，讲师
2006-2008，清华大学数学科学系，博士后
所授课程
微积分，线性代数，数学实验，算法设计与分析，计算复杂性理论，网络优化
奖励与荣誉
清华大学教学成果奖，一等奖，2014，2019
清华大学先进工作者，2015
清华大学优秀博士后，2008
近期论文
查看导师最新文章
（温馨提示：请注意重名现象，建议点开原文通过作者单位确认）
K. Nip, Z. Wang. Complexity and Algorithms for Two-machine Shop Scheduling Problems under Linear Constraints. Journal of Scheduling, 2020, accepted.
K. Nip, Z. Wang, Z. Wang. Assortment Optimization under a Single Transition Choice Model, Production and Operations Management, 2020, Accepted.
S. Zhang, K. Nip and Z. Wang. Related Machine Scheduling with Machine Speeds Satisfying Linear Constraints. Journal of Combinatorial Optimization, accepted, 2020.
K. Nip, Z. Wang. On the Approximability of the Two-phase Knapsack Problem. Journal of Combinatorial Optimization, 38: 1155-1179, 2019.
Z. Wang, X. Han, G. Dosa and Z. Tuza. A General Bin Packing Game-Interest Taken into Account. Algorithmica, 80: 1534-1555, 2018.
K. Nip, Z. Wang and Z. Wang. Knapsack with Variable Weights Satisfying Linear Constraints. Journal of Global Optimization, 69: 713-725, 2017.
Z. Wang and K. Nip. Bin Packing under linear constraints. Journal of Combinatorial Optimization, 34: 1198-1209, 2017.
W. Hong and Z. Wang. Improved approximation algorithm for the combination of parallel machine scheduling and vertex cover. International Journal of Foundations of Computer Science, 28: 977-992, 2017.
K. Nip, Z. Wang and W. Xing. A study on several combination problems of classic shop scheduling and shortest path. Theoretical Computer Science, 654: 175-187, 2016.
K. Nip, Z. Wang and Z. Wang. Scheduling under linear constraints. European Journal of Operational Research, 253: 290-297, 2016.
F. Talla Nobibon, R. Leus, K. Nip and Z. Wang. Resource loading with time windows. European Journal of Operational Research, 244: 404-416, 2015.
K. Nip, Z. Wang, F. Talla Nobibon and R. Leus. A Combination of flow shop scheduling and the shortest path problem. Journal of Combinatorial Optimization, 29: 36-52, 2015.
Z. Wang, W. Hong and D. He. A combination of parallel machine scheduling and the covering problem. Pacific Journal of Optimization, 10: 577-591, 2014.
C. Lu, Q. Jin, S.C. Fang, Z. Wang and W. Xing. Adaptive computable approximation to cones of nonnegative quadratic functions. Optimization, 63: 955-980, 2014.
X. Guo, Z. Deng, S. C. Fang, Z. Wang and W. Xing. Quadratic optimization over a second-order cone with linear equality constraints. Journal of the Operations Research Society of China, 2: 17-38, 2014.
J. Zhou, D. Chen, Z. Wang and W. Xing. A conic approximation method for the 0-1 quadratic knapsack problem. Journal of Industrial and Management Optimization, 9: 531-547, 2013.
Z. Wang and Z. Cui. Combination of parallel machine scheduling and vertex cover. Theoretical Computer Science, 460: 10-15, 2012.
Z. Wang, S. C. Fang, D. Y. Gao and W. Xing. Canonical dual approach to solving the maximum cut problem. Journal of Global Optimization, 54: 341-351, 2012.
Z. Wang. Worst-case performance of the successive approximation algorithm for four identical knapsacks. Journal of Industrial and Management Optimization, 8: 651-656, 2012.
C. Lu, S.C. Fang, Q. Jin, Z. Wang and W. Xing. KKT Solution and conic relaxation for solving quadratically constrained quadratic programming problems. SIAM Journal on Optimization, 21: 1475-1490, 2011.
Z. Wang, W. Xing and S.C. Fang. Two-person knapsack game. Journal of Industrial and Management Optimization, 6: 847-860, 2010.
C. Lu, Z. Wang, W. Xing and S. C. Fang. Extended canonical duality and conic programming for solving 0-1 quadratic programming problems. Journal of Industrial and Management Optimization, 6: 779-793, 2010.
Z. Wang, W. Xing and S.C. Fang. Two-group knapsack game. Theoretical Computer Science, 411: 1094-1103, 2010.
C. Lu, Z. Wang and W. Xing. An improved lower bound and approximation algorithm for binary quadratic integer programming. Journal of Global Optimization, 48:497-508, 2010.
Z. Wang and W. Xing. Worst-case analysis for on-line service policies. Journal of Combinatorial Optimization, 19: 107-122, 2010.
Z. Wang and W. Xing. A successive approximation algorithm for the multiple knapsack problem. Journal of Combinatorial Optimization, 17: 347-366, 2009.
Z. Wang, W. Xing and B. Chen. On-line service scheduling. Journal of Scheduling, 12: 31-43, 2009.
Z. Wang, S. C. Fang, D. Y. Gao and W. Xing. Global extremal conditions for multi-integer quadratic programming. Journal of Industrial and Management Optimization,4, 213-225, 2008.
Z. Wang and W. Xing. Performance of service policies in a specialized service system with parallel servers. Annals of Operations Research, 159, 451-460, 2008.
Z. Wang and W. Xing. Parallel machine scheduling with special jobs. Tsinghua Science and Technology, 11: 107-110, 2006.
Z. Wang, W. Xing and F. Bai. No-wait flexible flowshop scheduling with no-idle machines. Operations Research Letters, 33: 609-614, 2005.
谢金星, 邢文训, 王振波. 网络优化（第2版）.清华大出版社, 2009.
京公网安备 11010802027423号