Some Properties of Location Problems with Block and Round Norms

DOI10.1287/opre.32.6.1309zbMath0557.90023OpenAlexW2033163998MaRDI QIDQ3221721

Jacques-François Thisse, James E. Ward, Richard E. Wendell

Publication date: 1984

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.32.6.1309

zbMATH Keywords

continuous locationfacility locationWeber problempoint-objective problemquasi-efficient

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (30)

Un algorithme pour résoudre une famille de problèmes de localisation multisources ⋮ Unnamed Item ⋮ Localization in multifacility location theory ⋮ Multiobjective analysis of facility location decisions ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ Relationships between constrained and unconstrained multi-objective optimization and application in location theory ⋮ Obnoxious facility location in multiple dimensional space ⋮ Hamilton-Jacobi scaling limits of Pareto peeling in 2D ⋮ Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I. ⋮ Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II. ⋮ Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm ⋮ On Pareto optima, the Fermat-Weber problem, and polyhedral gauges ⋮ Meilleure approximation en norme vectorielle et théorie de la localisation ⋮ Determination of efficient solutions for point-objective locational decision problems ⋮ Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem ⋮ Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization ⋮ Local convergence in a generalized Fermat-Weber problem ⋮ Was Euclid an unnecessarily sophisticated psychologist? ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem ⋮ El conjunto eficiente en problemas de localizacion con normas mixtas (L p) ⋮ PARETO ENVELOPES IN SIMPLE POLYGONS ⋮ Local convexity results in a generalized Fermat-Weber problem ⋮ Approximation of solutions for location problems ⋮ A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem ⋮ Some personal views on the current state and the future of locational analysis ⋮ A characterization of efficient points in constrained location problems with regional demand ⋮ Unnamed Item ⋮ Geometrical properties of the Fermat-Weber problem ⋮ Efficiency in Euclidean constrained location problems

This page was built for publication: Some Properties of Location Problems with Block and Round Norms