An Application of Dynamic Programming to Location—Allocation Problems
From MaRDI portal
Publication:5332623
DOI10.1137/1007012zbMath0127.11104OpenAlexW2095290254MaRDI QIDQ5332623
Publication date: 1965
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1007012
Related Items (8)
LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY ⋮ Locating facilities in three‐dimensional space by convex programming ⋮ Duality in constrained location problems ⋮ Duality in constrained multi‐facility location models ⋮ Exact and approximate solutions to the multisource weber problem ⋮ Correspondence analysis with least absolute residuals ⋮ Normative location theory: Placement in continuous space ⋮ Some duality relationships for the generalized Neyman-Pearson problem
This page was built for publication: An Application of Dynamic Programming to Location—Allocation Problems
