Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
From MaRDI portal
Publication:3896801
DOI10.1287/opre.28.5.1241zbMath0449.90027OpenAlexW2001589066MaRDI QIDQ3896801
Jacky Perreur, Jacques-François Thisse, Pierre Hansen
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.5.1241
convexityconvex hulldominancelocationlogisticsmultifacility location problemlp-normsoctagonal hullrectilinear normone facility location problemsingle norm
Related Items
Unnamed Item ⋮ Localization in multifacility location theory ⋮ Geometric optimization and the polynomial hierarchy ⋮ Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study ⋮ Noncooperative facility location games ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ A discretizing algorithm for location problems ⋮ Dominating sets for convex functions with some applications ⋮ On Pareto optima, the Fermat-Weber problem, and polyhedral gauges ⋮ Meilleure approximation en norme vectorielle et théorie de la localisation ⋮ On a robustness property in single-facility location in continuous space ⋮ Hull properties in location problems ⋮ 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 ⋮ Was Euclid an unnecessarily sophisticated psychologist? ⋮ A new local search for continuous location problems ⋮ Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem ⋮ El conjunto eficiente en problemas de localizacion con normas mixtas (L p) ⋮ Covering problems with polyellipsoids: a location analysis perspective ⋮ Directional approach to gradual cover: the continuous case ⋮ PARETO ENVELOPES IN SIMPLE POLYGONS ⋮ A polygonal upper bound for the efficient set for single-facility location problems with mixed norms ⋮ Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations ⋮ A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem ⋮ Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms ⋮ A characterization of efficient points in constrained location problems with regional demand ⋮ Location problems with different norms for different points ⋮ Multiobjective control approximation problems: duality and optimality. ⋮ Geometrical properties of the Fermat-Weber problem ⋮ Localization in single facility location ⋮ Multiobjective solution of the uncapacitated plant location problem
