Automatic MILP Solver configuration by learning problem similarities
From MaRDI portal
Publication:6589112
DOI10.1007/S10479-023-05508-XMaRDI QIDQ6589112FDOQ6589112
Authors: Abdelrahman Hosny, Sherief Reda 
Publication date: 19 August 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Recommendations
- MPILS: an automatic tuner for MILP solvers
- Configuring mixed-integer programming solvers for large-scale instances
- Learning MILP resolution outcomes before reaching time-limit
- Paramils: an automatic algorithm configuration framework
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
Cites Work
- Efficient global optimization of expensive black-box functions
- \textsc{PySCIPOpt}: mathematical programming in Python with the SCIP optimization suite
- Visualizing data using t-SNE
- Title not available (Why is that?)
- Nonparametric guidance of autoencoder representations using label information
- Hyperband: a novel bandit-based approach to hyperparameter optimization
- Title not available (Why is that?)
- MaxSAT by improved instance-specific algorithm configuration
- Tuning metaheuristics. A machine learning Perspective
- Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Applications of combinatorial optimization
- Metric learning: a survey
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Learning a classification of mixed-integer quadratic programming problems
- Title not available (Why is that?)
- Learning when to use a decomposition
Cited In (3)
This page was built for publication: Automatic MILP Solver configuration by learning problem similarities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589112)
