Automatic MILP Solver configuration by learning problem similarities
From MaRDI portal
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
- scientific article; zbMATH DE number 5829047 (Why is no real title available?)
- scientific article; zbMATH DE number 6276119 (Why is no real title available?)
- Applications of combinatorial optimization
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Efficient global optimization of expensive black-box functions
- Hyperband: a novel bandit-based approach to hyperparameter optimization
- Learning a classification of mixed-integer quadratic programming problems
- Learning when to use a decomposition
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- MaxSAT by improved instance-specific algorithm configuration
- Metric learning: a survey
- Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
- Nonparametric guidance of autoencoder representations using label information
- SMAC3: a versatile Bayesian optimization package for hyperparameter optimization
- Tuning metaheuristics. A machine learning Perspective
- Visualizing data using t-SNE
- \textsc{PySCIPOpt}: mathematical programming in Python with the SCIP optimization suite
Cited in
(4)
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)
