The geometry of optimal partitions in location problems
From MaRDI portal
Publication:683940
DOI10.1007/s11590-017-1156-3zbMath1388.90070OpenAlexW2620681978MaRDI QIDQ683940
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
Related Items
Wildfire burn scar encapsulation. Subsetting common spatial domains for post-wildfire debris flow predictions over the United States, A new integer linear programming formulation for the problem of political districting, On the structure of higher order Voronoi cells, On location-allocation problems for dimensional facilities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal transport and a bilevel location-allocation problem
- On the structure of the solution set for the single facility location problem with average distances
- Locating a general minisum `circle' on the plane
- A flexible model and efficient solution strategies for discrete location problems
- On the optimal mapping of distributions
- Partially finite convex programming. II: Explicit lattice models
- The Weber problem with regional demand
- Continuous location of dimensional structures.
- Existence of optimal transport maps for crystalline norms
- A cooperative location game based on the 1-center location problem
- Asymptotic analysis of a class of optimal location problems
- A Planar Location-Allocation Problem with Waiting Time Costs
- Location Theory
- Using Block Norms for Location Modeling
- Note—Solving the Generalized Market Area Problem
- The Generalized Market Area Problem
- The generalized Weber problem with expected distances
- 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
- An Approach to Location Models Involving Sets as Existing Facilities
- Optimal Transport
- On bisectors for different distance functions
- On the circle closest to a set of points
