Localization in single facility location

DOI10.1016/0377-2217(84)90187-5zbMath0546.90031OpenAlexW2000982252MaRDI QIDQ798557

Frank Plastria

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90187-5

zbMATH Keywords

logisticsconvex hull propertymixed normscontinuous single facility locationWeber problem in the plane

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items

Solving general continuous single facility location problems by cutting planes, The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm, Planar point-objecitve location problems with nonconvex constraints: A geometrical construction, Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling, Dominating sets for convex functions with some applications, Location Problems with Cutoff, A trajectory based heuristic for the planar \(p\)-median problem, Segmented pseudometrics and four-point Fermat-Torricelli problems, Formulation of confidence intervals for estimated actual distances, Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets, GBSSS: The generalized big square small square method for planar single- facility location, An optimal method for solving the (generalized) multi-Weber problem, El conjunto eficiente en problemas de localizacion con normas mixtas (L p), A polygonal upper bound for the efficient set for single-facility location problems with mixed norms, On the structure of the weakly efficient set for quasiconvex vector minimization, Asymmetric distances, semidirected networks and majority in Fermat-Weber problems, Weber problems with alternative transportation systems, Restricted center problems under polyhedral gauges, General models in min-max continuous location: Theory and solution techniques, General models in min-max planar location: Checking optimality conditions, On the uniqueness of optimal solutions in continuous location theory

Cites Work

• Optimality and efficiency. I
• An algorithm for the minimax Weber problem
• Hull properties in location problems
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• Solutions of Constrained Location Problems
• Location Theory, Dominance, and Convexity
• Unnamed Item
• Unnamed Item