Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
From MaRDI portal
Publication:6099392
DOI10.1007/s10479-022-04976-xzbMath1516.90032OpenAlexW3135029173MaRDI QIDQ6099392
Jörg Kalcsics, Linda Kleist, Thomas Byrne, Sándor P. Fekete
Publication date: 20 June 2023
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-022-04976-x
Continuous location (90B85) 2-person games (91A05) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Voronoi game on graphs
- The one-round Voronoi game replayed
- Competitive location with rectilinear distances
- On locating new facilities in a competitive environment
- Finding a region with the minimum total \(L_1\) distance from prescribed terminals
- The one-round Voronoi game
- An alternating heuristic for medianoid and centroid problems in the plane
- Competitive facility location: the Voronoi game
- Traveling salesmen in the presence of competition
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
- The equitable location problem on the plane
- The minimum equitable radius location problem with continuous demand
- On the Stackelberg strategy in nonzero-sum games
- The Voronoi game on graphs and its complexity
- Advantage in the discrete Voronoi game
- Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand
- Nash Equilibria in Voronoi Games on Graphs
- Technical Note—Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem
- On Hotelling's "Stability in Competition"
- What is the optimal shape of a city?
- Existence of equilibrium configurations of competitive firms on an infinite two-dimensional space
- Location Science
- On the Continuous Fermat-Weber Problem
- Conditional Location Problems on Networks and in the Plane
- Location of facilities with rectangular distances among point and area destinations
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game