ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE
From MaRDI portal
Publication:2836517
DOI10.1142/S0217595912500509zbMath1267.90180MaRDI QIDQ2836517
Zhaowei Miao, Jiayan Xu, Ke Fu
Publication date: 3 July 2013
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595912500509
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
Related Items
New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior, A continuum perspective of customer choice rules for competitive facility location problems
Cites Work
- Unnamed Item
- On Nash equilibria of a competitive location-design problem
- Facility location models for distribution system design
- The \(p\)-median problem: a survey of metaheuristic approaches
- An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees
- On a branch-and-bound approach for a Huff-like Stackelberg location problem
- Competitive location with rectilinear distances
- Optimal packing and covering in the plane are NP-complete
- On locating new facilities in a competitive environment
- An algorithm for finding a maximum clique in a graph
- An alternating heuristic for medianoid and centroid problems in the plane
- On the Complexity of Some Common Geometric Location Problems
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- Note—On a Modified One-Center Model
- Competitive Location Models: A Framework and Bibliography
- Static competitive facility location: an overview of optimisation approaches.
