Alternating control tree search for knapsack/covering problems
From MaRDI portal
Publication:972644
DOI10.1007/S10732-008-9100-4zbMATH Open1187.90205OpenAlexW2134688846MaRDI QIDQ972644FDOQ972644
Authors: Lars Magnus Hvattum, Halvard Arntzen, Arne Løkketangen, Fred Glover 
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
Recommendations
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- The multidimensional knapsack problem: structure and algorithms
- Adaptive memory search for multidemand multidimensional knapsack problems
- On separating cover inequalities for the multidimensional knapsack problem
Cites Work
- Title not available (Why is that?)
- Local branching
- Conflict analysis in mixed integer programming
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Principles and Practice of Constraint Programming – CP 2004
- 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
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Static competitive facility location: an overview of optimisation approaches.
- A genetic algorithm for the multidimensional knapsack problem
- On the Solution of Discrete Programming Problems
- 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
- Title not available (Why is that?)
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- The Theory and Computation of Knapsack Functions
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Semi-obnoxious location models: A global optimization approach
- Zero-one programming with many variables and few constraints
- Title not available (Why is that?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Title not available (Why is that?)
Cited In (5)
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- Learning generalized strong branching for set covering, set packing, and 0-1 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
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
Uses Software
This page was built for publication: Alternating control tree search for knapsack/covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972644)
