An Application of Dynamic Programming to Location—Allocation Problems

DOI10.1137/1007012MaRDI QIDQ5332623zbMATH OpenOpenAlexFDO

Authors Richard Bellman

Publication date 1965

Published in SIAM Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1007012

zbMATH Keywords

operations research

Cited in

(8)

• Duality in constrained location problems
• Normative location theory: Placement in continuous space
• Some duality relationships for the generalized Neyman-Pearson problem
• LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
• Duality in constrained multi‐facility location models
• Locating facilities in three‐dimensional space by convex programming
• Exact and approximate solutions to the multisource weber problem
• Correspondence analysis with least absolute residuals

This page was built for publication: An Application of Dynamic Programming to Location—Allocation Problems

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