scientific article; zbMATH DE number 5282967
From MaRDI portal
Publication:3500140
Recommendations
- Scatter search for the 0-1 multidimensional knapsack problem
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Hard multidimensional multiple choice knapsack problems, an empirical study
- An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
Cited in
(14)- An application of the multiple knapsack problem: the self-sufficient marine
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- An empirical investigation on parallelization strategies for scatter search
- Robust efficiency measures for linear knapsack problem variants
- Parallel Scatter Search
- 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
- An optimization framework for solving large scale multidemand multidimensional knapsack problem instances employing a novel core identification heuristic
- A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Scatter search for the 0-1 multidimensional knapsack problem
- Alternating control tree search for knapsack/covering problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3500140)
