A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
DOI10.1287/IJOC.1030.0050zbMATH Open1239.90088OpenAlexW2138552202MaRDI QIDQ2890459FDOQ2890459
Authors: Paola Cappanera, Marco Trubian 
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/380b07e330162093fcd98aa76b2aab687cf9fd18
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
Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Boolean programming (90C09)
Cited In (19)
- Adaptive memory search for multidemand multidimensional knapsack problems
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- An application of the multiple knapsack problem: the self-sufficient marine
- Local search heuristics for the multidimensional assignment problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust efficiency measures for linear knapsack problem variants
- Black box scatter search for general classes of binary optimization problems
- Discrete facility location and routing of obnoxious activities.
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Alternating control tree search for knapsack/covering problems
- Title not available (Why is that?)
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem
- 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®
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- Exponential extrapolation memory for tabu search
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
Uses Software
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)
