A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
From MaRDI portal
Recommendations
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
- scientific article; zbMATH DE number 1728442
- New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Local search heuristics for the multidimensional assignment problem
- Local search heuristics for the multidimensional assignment problem
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- A heuristic algorithm for the multidimensional zero-one knapsack problem
Cited in
(23)- Discrete facility location and routing of obnoxious activities.
- 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
- First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem
- Adaptive memory search for multidemand multidimensional knapsack problems
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- scientific article; zbMATH DE number 1617338 (Why is no real title available?)
- Robust efficiency measures for linear knapsack problem variants
- scientific article; zbMATH DE number 5282967 (Why is no real title available?)
- scientific article; zbMATH DE number 6129400 (Why is no real title available?)
- A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX®
- Local search heuristics for the multidimensional assignment problem
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- Exponential extrapolation memory for tabu search
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
- Solution-based versus attribute-based tabu search for binary integer programming
- 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
- Algorithms and complexity results for the 0-1 knapsack problem with group fairness
- Alternating control tree search for knapsack/covering problems
- Black box scatter search for general classes of binary optimization problems
This page was built for publication: A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890459)
