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

DOI10.1287/MNSC.22.5.614MaRDI QIDQ4081019zbMATH OpenOpenAlexFDO

Authors Robert F. Love

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

Hamilton-Jacobi theories (49L99) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Mathematical programming (90C99)

Cited in

(14)

• Location and sizing of facilities on a line
• A two-echelon joint continuous-discrete location model
• Classical and inverse median location problems under uncertain environment
• Solving multiple facilities location problems with separated clusters
• 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
• Capacitated location-allocation problems on a line
• Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights
• Facility assignment with fair cost sharing: equilibrium and mechanism design
• 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

This page was built for publication: Note—One-Dimensional Facility Location-Allocation using Dynamic Programming

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