期刊
MATHEMATICAL PROGRAMMING COMPUTATION
卷 8, 期 1, 页码 113-132出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s12532-015-0096-0
关键词
Integer programming; Performance variability
类别
资金
- MiUR, Italy (PRIN)
- University of Padova
We discuss the variability in the performance of multiple runs of branch-and-cut mixed integer linear programming solvers, and we concentrate on the one deriving from the use of different optimal bases of the linear programming relaxations. We propose a new algorithm exploiting more than one of those bases and we show that different versions of the algorithm can be used to stabilize and improve the performance of the solver.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据