A computational status update for exact rational mixed integer programming
نویسندگان
چکیده
Abstract The last milestone achievement for the roundoff-error-free solution of general mixed integer programs over rational numbers was a hybrid-precision branch-and-bound algorithm published by Cook, Koch, Steffy, and Wolter in 2013. We describe substantial revision extension this framework that integrates symbolic presolving, features an exact repair step solutions from primal heuristics, employs faster LP solver based on iterative refinement, is able to produce independently verifiable certificates optimality. study significantly improved performance give insights into computational behavior new algorithmic components. On MIPLIB 2017 benchmark set, we observe average speedup 10.7x original 2.9 times as many instances solved within time limit two hours.
منابع مشابه
An Exact Rational Mixed-Integer Programming Solver
We present an exact rational solver for mixed-integer linear programming which avoids the numerical inaccuracies inherent in the floating-point computations adopted in existing software. This allows the solver to be used for establishing fundamental theoretical results and in applications where correct solutions are critical due to legal and financial consequences. Our solver is a hybrid symbol...
متن کاملExact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment
This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...
متن کاملA hybrid branch-and-bound approach for exact rational mixed-integer programming
We present an exact rational solver for mixed-integer linear programming that avoids the numerical inaccuracies inherent in the floating-point computations used by existing software. This allows the solver to be used for establishing theoretical results and in applications where correct solutions are critical due to legal and financial consequences. Our solver is a hybrid symbolic/numeric imple...
متن کاملA Computational Study of Search Strategies for Mixed Integer Programming
The branch and bound procedure for solving mixed integer programming MIP problems using linear programming relaxations has been used with great success for decades Over the years a variety of researchers have studied ways of making the basic algorithm more e ective Breakthroughs in the elds of computer hardware computer software and mathematics have led to increasing success at solving larger a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2022
ISSN: ['0025-5610', '1436-4646']
DOI: https://doi.org/10.1007/s10107-021-01749-5