A fast algorithm for the rectilinear distance location problem
From MaRDI portal
Publication:1616792
DOI10.1007/s00186-018-0629-1zbMath1406.90072OpenAlexW2784356200MaRDI QIDQ1616792
Ahmadreza Raeisi Dehkordi, Soghra Nobakhtian
Publication date: 7 November 2018
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-018-0629-1
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- Inverse \(p\)-median problems with variable edge lengths
- Primal-dual schema for capacitated covering problems
- Single facility location and relocation problem with time dependent weights and discrete planning horizon
- Finding efficient solutions for rectilinear distance location problems efficiently
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- Time bounds for selection
- Multi-period capacitated facility location under delayed demand satisfaction
- Rectilinear distance to a facility in the presence of a square barrier
- Optimizing capacity, pricing and location decisions on a congested network with balking
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- Technical Note—Solving Constrained Multi-Facility Location Problems Involving lp Distances Using Convex Programming
- Convex Analysis
- A note on Fermat's problem
- Combinatorial optimization. Theory and algorithms.
- On the collection depots location problem
This page was built for publication: A fast algorithm for the rectilinear distance location problem
