On the uniqueness of optimal solutions in continuous location theory

DOI10.1016/0377-2217(85)90005-0zbMath0564.90012OpenAlexW2094339118MaRDI QIDQ1058437

Blas Pelegrín, Frank Plastria, Christian Michelot

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90005-0

zbMATH Keywords

multi-facility locationcontinuous single facility minisum and minimax location problemsS-normuniqueness of an optimal solution

Mathematics Subject Classification ID

Convex programming (90C25) Inventory, storage, reservoirs (90B05)

Related Items (11)

How bad can the centroid be? ⋮ An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms ⋮ A discretizing algorithm for location problems ⋮ Using the power of ideal solutions: simple proofs of some old and new results in location theory ⋮ Locating a central hunter on the plane ⋮ Finding all pure strategy Nash equilibria in a planar location game ⋮ Local convexity results in a generalized Fermat-Weber problem ⋮ Multicriteria planar location problems ⋮ Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints ⋮ A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem ⋮ A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem

Cites Work

• Localization in single facility location
• Location Theory, Dominance, and Convexity
• Unnamed Item

This page was built for publication: On the uniqueness of optimal solutions in continuous location theory