4 papers · 1 filter
An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
Liang Chen, Wei-Kun Chen, Mu-Ming Yang +1
In this paper, we concentrate on generating cutting planes for the unsplittable capacitated network design problem. We use the unsplittable flow arc-set polyhedron of the considere…
An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection
Ping-Fan Zhao, Qing-Na Li, Wei-Kun Chen +1
Multiple-input multiple-output (MIMO) detection is a fundamental problem in wireless communications and it is strongly NP-hard in general. Massive MIMO has been recognized as a key…
Combinatorial separation algorithms for the continuous knapsack polyhedra with divisible capacities
Wei-Kun Chen, Yu-Hong Dai
It is important to design separation algorithms of low computational complexity in mixed integer programming. We study the separation problems of the two continuous knapsack polyhe…
On the complexity of sequentially lifting cover inequalities for the knapsack polytope
Wei-Kun Chen, Yu-Hong Dai
The well-known sequentially lifted cover inequality is widely employed in solving mixed integer programs. However, it is still an open question whether a sequentially lifted cover…