5 papers
Benders decomposition for the large-scale probabilistic set covering problem
Jie Liang, Cheng-Yang Yu, Wei Lv +2
In this paper, we consider a probabilistic set covering problem (PSCP) in which each 0-1 row of the constraint matrix is random with a finite discrete distribution, and the objecti…
An efficient linear programming rounding-and-refinement algorithm for large-scale network slicing problem
Wei-Kun Chen, Ya-Feng Liu, Yu-Hong Dai +1
In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastr…
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…
Solving Heated Oil Pipeline Problems Via Mixed Integer Nonlinear Programming Approach
Muming Yang, Yakui Huang, Yu-Hong Dai +1
It is a crucial problem how to heat oil and save running cost for crude oil transport. This paper strictly formulates such a heated oil pipeline problem as a mixed integer nonlinea…
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…