Automatic algorithm selection for pseudo-Boolean optimization with given computational time limits
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- A survey on the explainability of supervised machine learning
- ASlib: a benchmark library for algorithm selection
- Algorithm portfolios
- Bagging predictors
- Capping methods for the automatic configuration of optimization algorithms
- Curriculum-based course timetabling with SAT and MaxSAT
- Efficient local search for pseudo Boolean optimization
- Greedy function approximation: A gradient boosting machine.
- Instance space analysis and algorithm selection for the job shop scheduling problem
- Introduction to semi-supervised learning.
- MaxSAT by improved instance-specific algorithm configuration
- Multi-Agent Path Finding: A New Boolean Encoding
- Open-WBO: a modular MaxSAT solver
- Pseudo-Boolean optimization
- QMaxSAT: A partial Max-SAT solver
- Random forests
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- SATzilla: portfolio-based algorithm selection for SAT
- Scikit-learn: machine learning in Python
- The algorithm selection competitions 2015 and 2017
- Towards objective measures of algorithm performance across instance space
- aspeed: solver scheduling via answer set programming
This page was built for publication: Automatic algorithm selection for pseudo-Boolean optimization with given computational time limits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979054)
