Turnpike Theorems for Integer Programming Problems

DOI10.1287/OPRE.18.3.432MaRDI QIDQ5619725zbMATH OpenOpenAlexFDO

Authors Jeremy F. Shapiro

Publication date 1970

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.18.3.432

Mathematics Subject Classification ID

Integer programming (90C10) Dynamic programming (90C39)

Cited in

(2)

• An extension of Hu's group minimization algorithm
• Tight bounds for periodicity theorems on the unbounded knapsack problem

This page was built for publication: Turnpike Theorems for Integer Programming Problems

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