A submodular approach to discrete dynamic programming

DOI10.1016/0377-2217(93)E0329-VzbMath0928.90099OpenAlexW2012927420MaRDI QIDQ1129966

Cerry M. Klein

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0329-v

zbMATH Keywords

dualitydiscrete optimizationpolymatroidssubmodular functions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conjugate duality and the curse of dimensionality
• On the maximum transform
• DYNAMIC PROGRAMMING AND LAGRANGE MULTIPLIERS
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources

This page was built for publication: A submodular approach to discrete dynamic programming