Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures
From MaRDI portal
Recommendations
- An overview of heuristic solution methods
- Probabilistic approach to assessment of heuristics in 0?1 linear programming
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- A computational evaluation of optimal solution value estimation procedures
- Modeling Decisions for Artificial Intelligence
Cited in
(7)- Reverse adaptive krill herd locally weighted support vector regression for forecasting and trading exchange traded funds
- Measuring instance difficulty for combinatorial optimization problems
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
- Applying instance space analysis for metaheuristic selection to the 0-1 multidemand multidimensional knapsack problem
This page was built for publication: Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392107)
