Alternating control tree search for knapsack/covering problems

DOI10.1007/s10732-008-9100-4zbMath1187.90205OpenAlexW2134688846MaRDI QIDQ972644

Fred Glover, Halvard Arntzen, Lars Magnus Hvattum, Arne Løkketangen

Publication date: 21 May 2010

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-008-9100-4

zbMATH Keywords

coveringheuristicknapsacktree search

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items

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, Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem

Uses Software

• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-one programming with many variables and few constraints
• A genetic algorithm for the multidimensional knapsack problem
• Semi-obnoxious location models: A global optimization approach
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Improved results on the 0--1 multidimensional knapsack problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• New convergent heuristics for 0-1 mixed integer programming
• Conflict analysis in mixed integer programming
• Adaptive memory search for multidemand multidimensional knapsack problems
• Balancing and optimizing a portfolio of R&D projects
• A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
• On the Solution of Discrete Programming Problems
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
• The Theory and Computation of Knapsack Functions
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004
• Static competitive facility location: an overview of optimisation approaches.