Structured p-facility location problems on the line solvable in polynomial time
DOI10.1016/S0167-6377(97)00035-7zbMATH Open0892.90119OpenAlexW2055836554MaRDI QIDQ1382805FDOQ1382805
Timothy J. Lowe, Arie Tamir, Vernon N. Hsu
Publication date: 18 March 1998
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00035-7
Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Geometric applications of a matrix-searching algorithm
- Improved Algorithms for Economic Lot Size Problems
- Improved complexity bounds for location problems on the real line
- Solving covering problems and the uncapacitated plant location problem on trees
- The concave least-weight subsequence problem revisited
- A linear-time algorithm for concave one-dimensional dynamic programming
- Sequence comparison with mixed convex and concave costs
Cited In (8)
- The connected \(p\)-center problem on cactus graphs
- An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths
- The \(k\)-centrum multi-facility location problem
- The connected \(p\)-center problem on block graphs with forbidden vertices
- Multi-depot traveling salesmen location problems on networks with special structure
- A distance constrained \(p\)-facility location problem on the real line
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Efficient algorithms for centers and medians in interval and circular-arc graphs
This page was built for publication: Structured \(p\)-facility location problems on the line solvable in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382805)
