A discretizing algorithm for location problems
From MaRDI portal
Publication:1129969
DOI10.1016/0377-2217(93)E0145-NzbMath0928.90050MaRDI QIDQ1129969
Justo Puerto, Emilio Carrizosa
Publication date: 16 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0145-n
Related Items
Continuous multifacility ordered median location problems, On location-allocation problems for dimensional facilities, Location problems with different norms for different points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A destination optimality in asymmetric distance Fermat-Weber problems
- On the uniqueness of optimal solutions in continuous location theory
- Geometrical properties of the Fermat-Weber problem
- Solving general continuous single facility location problems by cutting planes
- The Minisum and Minimax Location Problems Revisited
- Minimizing a unimodal function of two integer variables
- A localization property for facility-location problems with arbitrary norms
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- The Asymmetric Distance Location Problem
- Convex Analysis