4 papers
Efficient exact sequential lifting algorithm for binary knapsack set
Xintong Wang, Liang Chen, Yu-Hong Dai
Lifting is a crucial technique in mixed integer programming (MIP) for generating strong valid inequalities, which serve as cutting planes to improve the branch-and-cut algorithm. W…
A Dynamic Relaxation Framework for Global Solution of ACOPF
Yu-Yang Tang, Liang Chen, Sheng-Jie Chen +3
Solving the Alternating Current Optimal Power Flow (AC OPF) problem to global optimality remains challenging due to its nonconvex quadratic constraints. In this paper, we present a…
A Cut-and-solve Algorithm for Virtual Machine Consolidation Problem
Jiang-Yao Luo, Liang Chen, Wei-Kun Chen +2
The virtual machine consolidation problem (VMCP) attempts to determine which servers to be activated, how to allocate virtual machines (VMs) to the activated servers, and how to mi…
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…