Structural properties of Voronoi diagrams in facility location problems with continuous demand
From MaRDI portal
(Redirected from Publication:3453339)
Recommendations
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
- Conditional facility location problems with continuous demand and a polygonal barrier
- Locational optimization problems solved through Voronoi diagrams
- scientific article; zbMATH DE number 3974683
- Solving continuous location-districting problems with Voronoi diagrams
Cites work
- A continuous analysis framework for the solution of location-allocation problems with dense demand
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- An efficient algorithm for the location-allocation problem with rectangular regions
- Efficiency for continuous facility location problems with attraction and repulsion
- Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
- Existence of equilibrium configurations of competitive firms on an infinite two-dimensional space
- Finding a guard that sees most and a shop that sells most
- scientific article; zbMATH DE number 3889235 (Why is no real title available?)
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 1340521 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- MAXIMIZING A VORONOI REGION: THE CONVEX CASE
- On the Continuous Fermat-Weber Problem
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Regional service coverage modeling
- Scheduling, Location, Transportation, and Continuum Mechanics: Some Simple Approximations to Optimization Problems
- Sequential location-allocation of public facilities in one- and two- dimensional space: Comparison of several policies
- Solving the continuous space p-centre problem: planning application issues
- The general optimal market area model
- The minimum weighted covering location problem with distance constraints
- The one-round Voronoi game replayed
- The p-center location problem in an area
- The Principle of Minimum Differentiation Reconsidered: Some New Developments in the Theory of Spatial Competition
Cited in
(14)- Locational optimization problems solved through Voronoi diagrams
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
- Continuous facility location on graphs
- Identifying the market areas of port-centric logistics and hinterland intermodal transportation
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
- Conditional facility location problems with continuous demand and a polygonal barrier
- Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities
- A computational method for optimizing the shape and location of a polygon on a plane
- scientific article; zbMATH DE number 3974683 (Why is no real title available?)
- Solving the continuous space p-centre problem: planning application issues
- A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
- Benders decomposition for stochastic facility location and production planning
- Solving continuous location-districting problems with Voronoi diagrams
This page was built for publication: Structural properties of Voronoi diagrams in facility location problems with continuous demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453339)
