The geometry of optimal partitions in location problems
From MaRDI portal
Publication:683940
DOI10.1007/S11590-017-1156-3zbMATH Open1388.90070OpenAlexW2620681978MaRDI QIDQ683940FDOQ683940
Authors: Lina Mallozzi, Justo Puerto 
Publication date: 9 February 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1156-3
Recommendations
- An Approach to Location Models Involving Sets as Existing Facilities
- scientific article; zbMATH DE number 4125186
- A localization property for facility-location problems with arbitrary norms
- Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
- Global solutions of partitioning problems∗
Cites Work
- Optimal Transport
- Location theory. A unified approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partially finite convex programming. II: Explicit lattice models
- Using Block Norms for Location Modeling
- Title not available (Why is that?)
- Continuous location of dimensional structures.
- On the structure of the solution set for the single facility location problem with average distances
- An Approach to Location Models Involving Sets as Existing Facilities
- Existence of optimal transport maps for crystalline norms
- On the optimal mapping of distributions
- A flexible model and efficient solution strategies for discrete location problems
- The Weber problem with regional demand
- The generalized Weber problem with expected distances
- A cooperative location game based on the 1-center location problem
- On the circle closest to a set of points
- Locating a general minisum `circle' on the plane
- A planar location-allocation problem with waiting time costs
- Optimal transport and a bilevel location-allocation problem
- Optimum and equilibrium in a transport problem with queue penalization effect
- Optimum and Equilibrium in Assignment Problems With Congestion: Mobile Terminals Association to Base Stations
- Modelling Inter-city Road Distances by Mathematical Functions
- Asymptotic analysis of a class of optimal location problems
- Note—Solving the Generalized Market Area Problem
- The Generalized Market Area Problem
- On bisectors for different distance functions
Cited In (12)
- Relajacion lagrangeana para el problema de particionamiento de áreas geográficas
- Effectiveness-based Voronoi partition: a new tool for solving a class of location optimization problems
- A planar location-allocation problem with waiting time costs
- Geometric complexity of some location problems
- Wildfire burn scar encapsulation. Subsetting common spatial domains for post-wildfire debris flow predictions over the United States
- Minimum-cost load-balancing partitions
- Title not available (Why is that?)
- On the structure of higher order Voronoi cells
- Global solutions of partitioning problems∗
- A new integer linear programming formulation for the problem of political districting
- On location-allocation problems for dimensional facilities
- Shadow prices in territory division
This page was built for publication: The geometry of optimal partitions in location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683940)
