Journal
MATHEMATICAL PROGRAMMING
Volume 197, Issue 2, Pages 793-812Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-021-01749-5
Keywords
Mixed integer programming; Exact computation; Rational arithmetic; Symbolic computations; Certificate of correctness
Ask authors/readers for more resources
A new algorithmic framework for general mixed integer programming problems is proposed, which integrates symbolic presolving, exact repair steps, and a faster LP solver. This framework shows significantly improved performance on benchmark instances, with an average speedup of 10.7x and 2.9 times as many instances solved within a time limit of two hours compared to the original framework.
The last milestone achievement for the roundoff-error-free solution of general mixed integer programs over the rational numbers was a hybrid-precision branch-and-bound algorithm published by Cook, Koch, Steffy, and Wolter in 2013. We describe a substantial revision and extension of this framework that integrates symbolic presolving, features an exact repair step for solutions from primal heuristics, employs a faster rational LP solver based on LP iterative refinement, and is able to produce independently verifiable certificates of optimality. We study the significantly improved performance and give insights into the computational behavior of the new algorithmic components. On the MIPLIB 2017 benchmark set, we observe an average speedup of 10.7x over the original framework and 2.9 times as many instances solved within a time limit of two hours.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available