Location Theory, Dominance, and Convexity
From MaRDI portal
Publication:5681817
DOI10.1287/OPRE.21.1.314zbMATH Open0265.90040OpenAlexW2171499897MaRDI QIDQ5681817FDOQ5681817
Authors: Richard E. Wendell, Arthur P. jun. Hurter
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
Cited In (70)
- The obnoxious competitive facility location model
- Solving a minisum single facility location problem in three regions with different norms
- Location of a distribution center for a perishable product
- Multipurpose shopping trips and location
- Tropical convexity in location problems
- Solving multiple facilities location problems with separated clusters
- WEIGHTEDp-CENTERS AND THE CONVEX HULL PROPERTY
- The Weber Location Problem: The Threshold Objective
- Pareto envelopes in simple polygons
- A trajectory based heuristic for the planar \(p\)-median problem
- The 1-center problem in the plane with independent random weights
- Weber problems with mixed distances and regional demand
- El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
- Planar weber location problems with line barriers
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
- Gradual cover competitive facility location
- A characterization of efficient points in constrained location problems with regional demand
- Multiobjective control approximation problems: duality and optimality.
- Cooperative cover of uniform demand
- A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem
- Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study
- An optimal method for solving the (generalized) multi-Weber problem
- Covering part of a planar network
- Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
- Location of an undesirable facility in a polygonal region with forbidden zones
- Weber's problem and weiszfeld's algorithm in general spaces
- Combinatorial algorithms for some 1-facility median problems in the plane
- Averaging the \(k\) largest distances among \(n\): \(k\)-centra in Banach spaces
- Meilleure approximation en norme vectorielle et théorie de la localisation
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Multiobjective solution of the uncapacitated plant location problem
- Solving general continuous single facility location problems by cutting planes
- On the structure of the solution set for the single facility location problem with average distances
- Dominating sets for convex functions with some applications
- Extensions to the Weber problem
- Directional approach to gradual cover: the continuous case
- Geometrical properties of the Fermat-Weber problem
- How bad can the centroid be?
- On the solution of the generalized steiner problem by the subgradient method
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- Location of the Fermat-Torricelli medians of three points
- Approximation of solutions for location problems
- The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution
- Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
- Title not available (Why is that?)
- New local searches for solving the multi-source Weber problem
- A general model for the undesirable single facility location problem
- 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 single facility location
- The fuzzy \(p\)-median problem: a global analysis of the solutions.
- Title not available (Why is that?)
- The Fermat--Torricelli problem in normed planes and spaces
- Convex hull properties in location theory
- Location problems with different norms for different points
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- A new bounding method for single facility location models
- Hull properties in location problems
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- Facility location in normed linear spaces
- Sets of efficient points in a normed space
- Normative location theory: Placement in continuous space
- An exact algorithm for the fuzzy p-median problem
- Efficiency in constrained continuous location
- Solving scheduling and location problems in the plane simultaneously
- General models in min-max continuous location: Theory and solution techniques
- A unified model for Weber problems with continuous and network distances
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- Optimal locations and inner products
- A stochastic gradual cover location problem
This page was built for publication: Location Theory, Dominance, and Convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5681817)