特别副研究员

当前位置: 陈伟坤

陈伟坤

个人简介


Personal Information

 

Name:  Wei-Kun Chen  ( 陈伟坤)

Email:  chenweikun@bit.edu.cn   cwk@lsec.cc.ac.cn  

Institute:  School of Mathematics and Statistics, BIT, 100081, China

Address: No.55 Zhongguancun South Street, Haidian District, Beijing, China

 


Educational Background

► 09/2014--07/2019, PhD in Computational Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences. SupervisorProf. Yu-Hong Dai. Major: mixed integer programming

► 09/2010--07/2014, Bachelor in Computational Mathematics, Sun Yat-Sen University, China 


Working Experience

► 08/2019--Present, Assistant Professor, School of Mathematics and Statistics, Beijing Institute of Technology


Publications 

Google Scholar

Working Papers

[J8] S.-J. Chen, W.-K. Chen, Y.-H. Dai, J.-H. Yuan, and H.-S. Zhang. Efficient Presolving Methods for Influence Maximization Problem in Social Networks, 2021. [link]

Journal Papers

[J1] 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. [link]

[J2] 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. [link]

[J3] 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. [link]

[J4] W.-K. Chen and Y.-H. Dai*. On the Complexity of Sequentially Lifting Cover Inequalities for the Knapsack Polytope, Science China Mathematics, Vol. 64, No. 1, pp. 211-220, 2021. [link]

[J5] 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, 2021. [link]

[J6] 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, 2021. [link]

[J7] P.-F. Zhao, Q.-N. Li*, W.-K. Chen, and Y.-F. Liu, An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection, Accepted by SIAM Journal on Optimization, 2021. [link]

Conference Papers

[C1] W.-K. Chen, Y.-F. Liu*, A. De Domenico, and Z.-Q. Luo. Network Slicing for Service-oriented Networks with Flexible Routing and Guaranteed E2E Latency, IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), May 26–29, 2020. [link]

[C2] W.-K. Chen, Y.-F. Liu*, Y.-H. Dai, and Z.-Q. Luo. An Efficient Linear Programming Rounding-and-refinement Algorithm for Large-scale Network Slicing Problem, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), June 6–11, 2021. [link]

Report

[R1] G. Gamrath, D. Anderson, K. Bestuzheva, W.-K. Chen, L. Eifler, M. Gasse, P. Gemander, K. Halbig, T. Koch, A. Gleixner, L. Gottwald, G. Hendel, C. Hojny, P.L Bodic, S.J. Maher, F. Matter, M. Miltenberger, E. Muhmer, B. Muller, M.E. Pfetsch, F. Schlosser, F. Serrano, Y. Shinano, C. Tawfik, S. Vigerske. F. Wegscheider, D. Weninger, J. Witzig. The SCIP Optimization Suite 7.0, 2020. [link]




Visiting Positions

► 03/2018--03/2019, Visiting Scholar, Zuse Institute Berlin, Berlin, Germany. HostProf. Thorsten Koch


Fundings

 01/2017--12/2021, Optimization Theory and Methods for Big Data Analysis, National Natural Science Foundation of China (NSFC) (Grant No. 11631013), Participant

Interests

We are working on mixed integer programming and its applications to wireless communications and social networks.