Competitive location in the plane

DOI10.1007/BF02060476zbMATH Open0787.90044MaRDI QIDQ689241FDOQ689241

Authors: Zvi Drezner, Eitan Zemel 

Publication date: 1992

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

Recommendations

• Optimal location and design of a competitive facility
• scientific article; zbMATH DE number 1323030
• Competitive location with rectilinear distances
• Competitive location on a network
• LOCATING MULTIPLE FACILITIES IN A PLANAR COMPETITIVE ENVIRONMENT

zbMATH Keywords

competitive environmentbest location

Mathematics Subject Classification ID

Continuous location (90B85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On locating new facilities in a competitive environment
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• New perspectives in competitive location theory
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Covering space by spheres
• The Covering Of Space By Spheres
• Title not available (Why is that?)
• A Class of Balanced Matrices Arising from Location Problems
• Covering space with equal spheres
• Probabilistic Analysis of the Planar k-Median Problem

Cited In (13)

• 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
• Cooperative cover of uniform demand
• Locating a competitive facility in the plane with a robustness criterion
• Asymptotic optimal location of facilities in a competition between population and industries
• Competitive location models: a review
• Optimal multifacility defensive location on planes with rectilinear distances
• Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location
• Exact algorithms for the solution of the grey pattern quadratic assignment problem
• The \((1 | 1)\)-centroid problem in the plane with distance constraints
• Location-allocation on a line with demand-dependent costs
• On the conditional \(p\)-median problem
• The rival coffee shop problem

This page was built for publication: Competitive location in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689241)