Adaptive memory search for multidemand multidimensional knapsack problems

DOI10.1016/J.COR.2005.07.007MaRDI QIDQ2489302zbMATH OpenOpenAlexFDO

Authors Halvard Arntzen, Arne Løkketangen, Lars Magnus Hvattum

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

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

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

Cites work

• scientific article; zbMATH DE number 1054947 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 1846893 (Why is no real title available?)
• A genetic algorithm for the multidimensional knapsack problem
• A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
• Adaptive memory search for Boolean optimization problems
• An Introduction to Tabu Search
• Balancing and optimizing a portfolio of R&D projects
• Semi-obnoxious location models: A global optimization approach
• Solving zero-one mixed integer programming problems using tabu search
• Static competitive facility location: an overview of optimisation approaches.
• The multidimensional 0-1 knapsack problem: an overview.

Cited in

(15)

• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
• An application of the multiple knapsack problem: the self-sufficient marine
• scientific article; zbMATH DE number 2209664 (Why is no real title available?)
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• 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
• Alternating control tree search for knapsack/covering problems
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack 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
• Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
• Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis

Describes a project that uses

Uses Software

• Tabu search
• OR-Library

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)