Mixed-integer Algorithms for the (0,1) Knapsack Problem

DOI10.1147/RD.164.0424MaRDI QIDQ5675548zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Renewal theory (60K05) Integer programming (90C10)

Cited in

(3)

• An algorithm and efficient data structures for the binary knapsack problem
• Cascading knapsack inequalities: reformulation of a crude oil distribution problem
• The Collapsing 0–1 Knapsack Problem

This page was built for publication: Mixed-integer Algorithms for the (0,1) Knapsack Problem

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