Competitive location in the plane

DOI10.1007/BF02060476zbMath0787.90044MaRDI QIDQ689241

Zvi Drezner, Eitan Zemel

Publication date: 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

competitive environmentbest location

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items

The (1|1)-Centroid Problem in the Plane with Distance Constraints, On the conditional \(p\)-median problem, Exact algorithms for the solution of the grey pattern quadratic assignment problem, Cooperative cover of uniform demand, Location-allocation on a line with demand-dependent costs, An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon, Central Places: The Theories of von Thünen, Christaller, and Lösch

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New perspectives in competitive location theory
• On locating new facilities in a competitive environment
• A Class of Balanced Matrices Arising from Location Problems
• Covering space by spheres
• The Covering Of Space By Spheres
• Covering space with equal spheres
• Probabilistic Analysis of the Planar k-Median Problem
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Note—On a Modified One-Center Model
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Sum of moments of convex polygons