Note—One-Dimensional Facility Location-Allocation using Dynamic Programming

DOI10.1287/mnsc.22.5.614zbMath0318.90054MaRDI QIDQ4081019

Love, Robert F.

Publication date: 1976

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.22.5.614

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C90: Applications of mathematical programming

90C99: Mathematical programming

49L99: Hamilton-Jacobi theories

Related Items

Capacitated location-allocation problems on a line, Exact and heuristic algorithms for the Hamiltonian \(p\)-median problem, A new heuristic for solving the \(p\)-median problem in the plane, A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand, New algorithms for facility location problems on the real line, Sequential location-allocation of public facilities in one- and two- dimensional space: Comparison of several policies, Optimizing the location of a production firm, Stochastic location-assignment on an interval with sequential arrivals, Location and sizing of facilities on a line, A two-echelon joint continuous-discrete location model