Location Theory, Dominance, and Convexity
From MaRDI portal
Publication:5681817
DOI10.1287/opre.21.1.314zbMath0265.90040OpenAlexW2171499897MaRDI QIDQ5681817
Arthur P. jun. Hurter, Richard E. Wendell
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.1.314
Related Items
A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem ⋮ Sets of efficient points in a normed space ⋮ Solving general continuous single facility location problems by cutting planes ⋮ Covering part of a planar network ⋮ Combinatorial algorithms for some 1-facility median problems in the plane ⋮ Planar point-objecitve location problems with nonconvex constraints: A geometrical construction ⋮ Unnamed Item ⋮ WEIGHTEDp-CENTERS AND THE CONVEX HULL PROPERTY ⋮ Location of a distribution center for a perishable product ⋮ Extensions to the Weber problem ⋮ How bad can the centroid be? ⋮ A unified model for Weber problems with continuous and network distances ⋮ Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ Convex hull properties in location theory ⋮ Dominating sets for convex functions with some applications ⋮ Multipurpose shopping trips and location ⋮ The Weber Location Problem: The Threshold Objective ⋮ A trajectory based heuristic for the planar \(p\)-median problem ⋮ The obnoxious competitive facility location model ⋮ Solving a minisum single facility location problem in three regions with different norms ⋮ Gradual cover competitive facility location ⋮ On Pareto optima, the Fermat-Weber problem, and polyhedral gauges ⋮ Meilleure approximation en norme vectorielle et théorie de la localisation ⋮ A new bounding method for single facility location models ⋮ Self-organizing feature maps for solving location--allocation problems with rectilinear distances. ⋮ Hull properties in location problems ⋮ Averaging the \(k\) largest distances among \(n\): \(k\)-centra in Banach spaces ⋮ Unnamed Item ⋮ The 1-center problem in the plane with independent random weights ⋮ Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets ⋮ Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem ⋮ Facility location in normed linear spaces ⋮ Weber problems with mixed distances and regional demand ⋮ A general model for the undesirable single facility location problem ⋮ A stochastic gradual cover location problem ⋮ Optimal locations and inner products ⋮ Planar weber location problems with line barriers ⋮ New local searches for solving the multi-source Weber problem ⋮ The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution ⋮ An optimal method for solving the (generalized) multi-Weber problem ⋮ The fuzzy \(p\)-median problem: a global analysis of the solutions. ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ Cooperative cover of uniform demand ⋮ On the structure of the solution set for the single facility location problem with average distances ⋮ On the solution of the generalized steiner problem by the subgradient method ⋮ El conjunto eficiente en problemas de localizacion con normas mixtas (L p) ⋮ Normative location theory: Placement in continuous space ⋮ Weber's problem and weiszfeld's algorithm in general spaces ⋮ Directional approach to gradual cover: the continuous case ⋮ Solving scheduling and location problems in the plane simultaneously ⋮ PARETO ENVELOPES IN SIMPLE POLYGONS ⋮ Solving multiple facilities location problems with separated clusters ⋮ A polygonal upper bound for the efficient set for single-facility location problems with mixed norms ⋮ The Fermat--Torricelli problem in normed planes and spaces ⋮ Approximation of solutions for location problems ⋮ A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem ⋮ Efficiency in constrained continuous location ⋮ General models in min-max continuous location: Theory and solution techniques ⋮ A characterization of efficient points in constrained location problems with regional demand ⋮ Location of an undesirable facility in a polygonal region with forbidden zones ⋮ Location problems with different norms for different points ⋮ Multiobjective control approximation problems: duality and optimality. ⋮ On the uniqueness of optimal solutions in continuous location theory ⋮ Geometrical properties of the Fermat-Weber problem ⋮ Localization in single facility location ⋮ Multiobjective solution of the uncapacitated plant location problem ⋮ An exact algorithm for the fuzzy p-median problem ⋮ Location of the Fermat-Torricelli medians of three points
