Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum

DOI10.1051/RO/1993270201691MaRDI QIDQ4201825zbMATHOpenAlexFDO

Authors Arnaud Fréville, Gérard Plateau

Publication date 29 August 1993

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105055

zbMATH Keywords

surrogate dualtight bounds0-1 multidimensional knapsack problembidimensional knapsack

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09)

Recommendations

• Improved results on the 0--1 multidimensional knapsack problem
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.

Cited in

(17)

• Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
• On The Strength Of Relaxations Of Multidimensional Knapsack Problems
• The fractional multidimensional knapsack problem: solution and uniqueness
• The multidimensional 0-1 knapsack problem: an overview.
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Scatter search for the 0-1 multidimensional knapsack problem
• An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
• Improved results on the 0--1 multidimensional knapsack problem
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
• Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
• Multicriteria 0-1 knapsack problems with \(k\)-min objectives
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
• Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem

This page was built for publication: Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4201825)