scientific article

zbMath0439.90060MaRDI QIDQ3882189

Ron S. Dembo, Peter L. Hammer

Publication date: 1980

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

zbMATH Keywords

Lagrangean relaxationcomputational experiencereduction algorithmknapsack problemsrandomly generated test problemslarge problemsbounds improvement

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (15)

Exact methods for the knapsack problem and its generalizations ⋮ A pegging approach to the precedence-constrained knapsack problem ⋮ New exact approaches and approximation results for the penalized knapsack problem ⋮ The knapsack problem with generalized upper bounds ⋮ An exact algorithm for large multiple knapsack problems ⋮ An expanding-core algorithm for the exact \(0-1\) knapsack problem ⋮ A minimal algorithm for the Bounded Knapsack Problem ⋮ Qos-aware service evaluation and selection ⋮ Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem ⋮ A new variable reduction technique for convex integer quadratic programs ⋮ Tolerance analysis for 0-1 knapsack problems ⋮ Heuristic approaches for the two- and three-dimensional knapsack packing problem ⋮ An algorithm and efficient data structures for the binary knapsack problem ⋮ An exact algorithm for the fixed-charge multiple knapsack problem ⋮ A heuristic algorithm for the multidimensional zero-one knapsack problem

This page was built for publication: