Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
From MaRDI portal
Publication:4081019
DOI10.1287/mnsc.22.5.614zbMath0318.90054OpenAlexW2168876641MaRDI QIDQ4081019
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
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Mathematical programming (90C99) Hamilton-Jacobi theories (49L99)
Related Items (13)
Location and sizing of facilities 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 ⋮ A two-echelon joint continuous-discrete location model ⋮ Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights ⋮ Classical and inverse median location problems under uncertain environment ⋮ New algorithms for facility location problems on the real line ⋮ Optimizing the location of a production firm ⋮ Stochastic location-assignment on an interval with sequential arrivals ⋮ Capacitated location-allocation problems on a line ⋮ Solving multiple facilities location problems with separated clusters ⋮ Sequential location-allocation of public facilities in one- and two- dimensional space: Comparison of several policies
This page was built for publication: Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
