Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming

DOI10.1287/opre.46.5.702zbMath0979.90120OpenAlexW2088741806MaRDI QIDQ2770100

Jack Brimberg, Love, Robert F.

Publication date: 7 February 2002

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

one-dimensional dynamic programmingtwo-dimensional location-allocation problems

Mathematics Subject Classification ID

Dynamic programming (90C39) Discrete location and assignment (90B80)

Related Items (4)

Location and sizing of facilities on a line ⋮ A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand ⋮ A two-echelon joint continuous-discrete location model ⋮ Solving multiple facilities location problems with separated clusters

This page was built for publication: Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming