[1] W.-K. Chen, L. Chen, M.-M. Yang and Y.-H. Dai, Generalized Coefficient Strengthening Cuts for Mixed Integer Programming, Journal of Global Optimization, Vol. 70, No. 1, pp. 289-306, 2018.
[2] Z. Guo, W.-K. Chen, Y.-F Liu, Y. Xu and Z.-L. Zhang, Joint Switch Upgrade and Controller Deployment in Hybrid Software-Defined Networks, IEEE Journal on Selected Areas in Communications, Vol. 37, No. 5, pp. 1012-1028, 2019.
[3] W.-K. Chen and Y.-H. Dai. On the Complexity of Sequentially Lifting Cover Inequalities for the Knapsack Polytope, Science China Mathematics, Vol. 64, 211-220, 2021.
[4] P. Gemander, W.-K. Chen, D. Weninger, L. Gottwald, A. Gleixner, and A. Martin. Two-row and Two-column Mixed-integer Presolve Using Hashing-based Pairing Methods, EURO Journal on Computational Optimization, Vol. 8, pp. 205–240, 2020.
[5] L. Chen, W.-K. Chen, M.-M. Yang, and Y.-H. Dai. An Exact Separation Algorithm for Unsplittable Flow Capacitated Network Design Arc-set Polyhedron. Journal of Global Optimization, Vol. 81, pp. 659-689, 2021.
[6] P.-F. Zhao, Q.-N. Li, W.-K. Chen, and Y.-F. Liu. An Efficient Sparse Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection, SIAM Journal on Optimization, Vol 31, No. 2, 1519-1545, 2021.
[7] W.-K. Chen, Y.-F. Liu, A. De Domenico, Z.-Q. Luo, and Y.-H. Dai. Optimal Network Slicing for Service-Oriented Networks with Flexible Routing and Guaranteed E2E Latency, IEEE Transactions on Network and Service Management, vol. 18, no. 4, pp. 4337-4352, 2021.
My Google Scholar profile: https://scholar.google.com/citations?user=HDtIF_QAAAAJ&hl=en
