Adaptive memory search for multidemand multidimensional knapsack problems

DOI10.1016/j.cor.2005.07.007zbMath1086.90046OpenAlexW2069600231MaRDI QIDQ2489302

Arne Løkketangen, Halvard Arntzen, 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)

Related Items (11)

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 ⋮ 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 ⋮ An application of the multiple knapsack problem: the self-sufficient marine ⋮ Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem ⋮ A tabu search approach for the livestock collection problem ⋮ An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines ⋮ Alternating control tree search for knapsack/covering problems ⋮ Black box scatter search for general classes of binary optimization problems

Uses Software

• OR-Library
• Tabu search

Cites Work

• A genetic algorithm for the multidimensional knapsack problem
• Semi-obnoxious location models: A global optimization approach
• The multidimensional 0-1 knapsack problem: an overview.
• Solving zero-one mixed integer programming problems using tabu search
• Adaptive memory search for Boolean optimization problems
• 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
• Static competitive facility location: an overview of optimisation approaches.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Adaptive memory search for multidemand multidimensional knapsack problems