scientific article

zbMath0564.90037MaRDI QIDQ3678962

Gérard Plateau, Moussa Elkihel

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hybrid methodimplicit enumeration0-1 knapsack problemComputational resultssubset-sum problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Dynamic programming (90C39) Boolean programming (90C09)

Related Items (19)

A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem ⋮ A new enumeration scheme for the knapsack problem ⋮ Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem ⋮ A dynamic programming algorithm for the knapsack problem with setup ⋮ Some thoughts on combinatorial optimisation ⋮ A minimal algorithm for the multiple-choice knapsack problem ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup ⋮ Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Two linear approximation algorithms for the subset-sum problem ⋮ A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem ⋮ Bridging game theory and the knapsack problem: a theoretical formulation ⋮ Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers ⋮ A hybrid algorithm for the unbounded knapsack problem ⋮ New trends in exact algorithms for the \(0-1\) knapsack problem ⋮ Heuristics for the 0-1 multidimensional knapsack problem ⋮ Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects ⋮ An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

This page was built for publication: