Localization in single facility location

DOI10.1016/0377-2217(84)90187-5zbMATH Open0546.90031OpenAlexW2000982252MaRDI QIDQ798557FDOQ798557

Authors: 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

Recommendations

• Localization in multifacility location theory
• A localization property for facility-location problems with arbitrary norms
• Some Properties of Location Problems with Block and Round Norms
• scientific article; zbMATH DE number 1803754
• An Approach to Location Models Involving Sets as Existing Facilities

zbMATH Keywords

logisticsmixed normsconvex hull propertycontinuous single facility locationWeber problem in the plane

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cites Work

• Location Theory, Dominance, and Convexity
• Hull properties in location problems
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• Title not available (Why is that?)
• Optimality and efficiency. I
• An algorithm for the minimax Weber problem
• Title not available (Why is that?)
• Solutions of Constrained Location Problems

Cited In (27)

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

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)