Mixed-integer Algorithms for the (0,1) Knapsack Problem
From MaRDI portal
Publication:5675548
DOI10.1147/rd.164.0424zbMath0258.90036OpenAlexW1990554200MaRDI QIDQ5675548
M. M. Guignard, Kurt Spielberg
Publication date: 1972
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1147/rd.164.0424
Related Items (3)
Cascading knapsack inequalities: reformulation of a crude oil distribution problem ⋮ The Collapsing 0–1 Knapsack Problem ⋮ An algorithm and efficient data structures for the binary knapsack problem
This page was built for publication: Mixed-integer Algorithms for the (0,1) Knapsack Problem
