A cut-and-solve algorithm for virtual machine consolidation problem

Jiang-Yao Luo, Liang Chen, Weikun Chen, Jian-Hua Yuan, Yu-Hong Dai

Abstract: Highlights•New MILP formulations are proposed for the virtual machine consolidation problem.•The proposed new formulation is much more compact than existing formulations.•A cut-and-solve algorithm is developed to solve the problem to optimality.•The proposed cut-and-solve algorithm relies on a novel relaxation of the problem.