Configuring mixed-integer programming solvers for large-scale instances

DOI10.1007/S43069-024-00327-7MaRDI QIDQ6559533zbMATH OpenFDO

Authors Robin Kemminer, Jannick Lange, Jens Peter Kempkes, Kevin Tierney, Dimitri Weiß

Publication date 21 June 2024

Published in SN Operations Research Forum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

mixed integer programmingalgorithm configurationlarge-scale problem instances

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11)

Recommendations

• MPILS: an automatic tuner for MILP solvers
• Paramils: an automatic algorithm configuration framework
• Boosting evolutionary algorithm configuration
• Automatic MILP Solver configuration by learning problem similarities
• Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic

Cites work

• A Survey of Methods for Automated Algorithm Configuration
• DASH: dynamic approach for switching heuristics
• Exploiting erraticism in search
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• Paramils: an automatic algorithm configuration framework
• PyDGGA: distributed GGA for automatic configuration
• SMAC3: a versatile Bayesian optimization package for hyperparameter optimization

Cited in

(4)

• Automatic MILP Solver configuration by learning problem similarities
• MPILS: an automatic tuner for MILP solvers
• Artificial intelligence for optimization: unleashing the potential of parameter generation, model formulation, and solution methods
• A method for the automated configuration of anytime portfolios of algorithms

This page was built for publication: Configuring mixed-integer programming solvers for large-scale instances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559533)