A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
From MaRDI portal
Publication:2890459
DOI10.1287/ijoc.1030.0050zbMath1239.90088OpenAlexW2138552202MaRDI QIDQ2890459
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
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items (12)
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® ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Robust efficiency measures for linear knapsack problem variants ⋮ A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint ⋮ When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners ⋮ Exponential extrapolation memory for tabu search ⋮ 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 ⋮ Alternating control tree search for knapsack/covering problems ⋮ Adaptive memory search for multidemand multidimensional knapsack problems ⋮ Black box scatter search for general classes of binary optimization problems
Uses Software
This page was built for publication: A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
