Localization in single facility location
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3748733 (Why is no real title available?)
- scientific article; zbMATH DE number 3291744 (Why is no real title available?)
- An algorithm for the minimax Weber problem
- Hull properties in location problems
- Location Theory, Dominance, and Convexity
- Optimality and efficiency. I
- Solutions of Constrained Location Problems
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
Cited in
(27)- A polygonal upper bound for the efficient set for single-facility location problems with mixed norms
- Restricted center problems under polyhedral gauges
- Localization in multifacility location theory
- Geometrical properties of the symmetrical single facility location problem
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
- An optimal method for solving the (generalized) multi-Weber problem
- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
- El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- Continuous location of an assembly station
- GBSSS: The generalized big square small square method for planar single- facility location
- General models in min-max continuous location: Theory and solution techniques
- General models in min-max planar location: Checking optimality conditions
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
- A trajectory based heuristic for the planar \(p\)-median problem
- Algorithms - ESA 2003
- Weber problems with alternative transportation systems
- Transponder-Aided Single Platform Geolocation
- Dominating sets for convex functions with some applications
- Solving general continuous single facility location problems by cutting planes
- On the structure of the weakly efficient set for quasiconvex vector minimization
- On the uniqueness of optimal solutions in continuous location theory
- Location Problems with Cutoff
- Segmented pseudometrics and four-point Fermat-Torricelli problems
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- Formulation of confidence intervals for estimated actual distances
- On a robustness property in single-facility location in continuous space
This page was built for publication: Localization in single facility location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798557)
