A multi-level search strategy for the 0-1 multidimensional knapsack problem
type: Item
instance of: scholarly article
title: A multi-level search strategy for the 0-1 multidimensional knapsack problem
zbMATH Open document ID: 1185.90170
author: Sylvain Boussier
author: Michel Vasquez
author: Yannick Vimont
author: Saïd Hanafi
author: Philippe Michelon
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
full work available at URL: https://eudml.org/doc/197839
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5703711
zbMATH Keywords: resolution search
zbMATH Keywords: branch \& bound
zbMATH Keywords: reduced costs
zbMATH Keywords: 0-1 multidimensional knapsack problem
describes a project that uses: OR-Library
describes a project that uses: Knapsack
MaRDI profile type: Publication
OpenAlex ID: W2034850884
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Resolution search
cites work: Integer Programming and Combinatorial Optimization
cites work: Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
cites work: An algorithm for the solution of the 0-1 knapsack problem
cites work: An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
cites work: The multidimensional 0-1 knapsack problem: an overview.
cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: The Theory and Computation of Knapsack Functions
cites work: Q4386920
cites work: Resolution search and dynamic branch-and-bound
cites work: Q4821303
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: A Shrinking Boundary Algorithm for Discrete System Models
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
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
cites work: Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
cites work: New convergent heuristics for 0-1 mixed integer programming
DOI: 10.1016/J.DAM.2009.08.007
description: scientific article; zbMATH DE number 5703711