Alternating control tree search for knapsack/covering problems
type: Item
instance of: scholarly article
title: Alternating control tree search for knapsack/covering problems
zbMATH Open document ID: 1187.90205
author: Lars Magnus Hvattum
author: Halvard Arntzen
author: Arne Løkketangen
author: Fred Glover
published in: Journal of Heuristics
publication date: 2010-05-21T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5710642
zbMATH Keywords: knapsack
zbMATH Keywords: covering
zbMATH Keywords: tree search
zbMATH Keywords: heuristic
describes a project that uses: Tabu search
describes a project that uses: Scatter Search
MaRDI profile type: Publication
full work available at URL: s10732-008-9100-4
OpenAlex ID: W2134688846
cites work: Conflict analysis in mixed integer programming
cites work: Adaptive memory search for multidemand multidimensional knapsack problems
cites work: Balancing and optimizing a portfolio of R&D projects
cites work: Q4786623
cites work: A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Local branching
cites work: The Theory and Computation of Knapsack Functions
cites work: Q4354785
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: New convergent heuristics for 0-1 mixed integer programming
cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
cites work: Q3500140
cites work: Scatter search. Methodology and implementation in C. With CD-ROM.
cites work: On the Solution of Discrete Programming Problems
cites work: Static competitive facility location: an overview of optimisation approaches.
cites work: Semi-obnoxious location models: A global optimization approach
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: Q4411416
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: Zero-one programming with many variables and few constraints
cites work: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
cites work: Improved results on the 0--1 multidimensional knapsack problem
DOI: 10.1007/S10732-008-9100-4
description: scientific article; zbMATH DE number 5710642