Adaptive memory search for multidemand multidimensional knapsack problems
From MaRDI portal
Publication:2489302
DOI10.1016/J.COR.2005.07.007zbMATH Open1086.90046OpenAlexW2069600231MaRDI QIDQ2489302FDOQ2489302
Lars Magnus Hvattum, Arne Løkketangen, Halvard Arntzen
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.07.007
Recommendations
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Static competitive facility location: an overview of optimisation approaches.
- A genetic algorithm for the multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Balancing and optimizing a portfolio of R&D projects
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
- An Introduction to Tabu Search
- Solving zero-one mixed integer programming problems using tabu search
- Title not available (Why is that?)
- Semi-obnoxious location models: A global optimization approach
- Adaptive memory search for Boolean optimization problems
- Title not available (Why is that?)
Cited In (13)
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- An application of the multiple knapsack problem: the self-sufficient marine
- 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
- 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
- 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 tabu search approach for the livestock collection problem
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines
- 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: Adaptive memory search for multidemand multidimensional knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489302)
