On the complexity of the \((r|p)\)-centroid problem in the plane

DOI10.1007/s11750-013-0275-yzbMath1297.90069OpenAlexW2114002675MaRDI QIDQ456933

Ivan Davydov, Aleksandr V. Plyasunov, Yury A. Kochetov

Publication date: 26 September 2014

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-013-0275-y

zbMATH Keywords

bilevel programmingcompetitive locationleader-follower problem

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

A bilevel planning model for public-private partnership, The (1|1)-Centroid Problem in the Plane with Distance Constraints, A local search heuristic for the \((r| p)\)-centroid problem in the plane, Exact method for the capacitated competitive facility location problem, An exact method for the discrete \((r|p)\)-centroid problem, Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem, The multilevel facility location and pricing problems: the computational complexity and the stability analysis, Comparison of models of planning public-private partnership, Bilevel competitive facility location and pricing problems, A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem, Stability Analysis for Pricing, A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand, \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario, VNS heuristic for the –centroid problem on the plane, Competitive location in cognitive radio networks, Computational complexity of the discrete competitive facility location problem

Cites Work

• Unnamed Item
• Sequential competitive location on networks
• Multiple voting location and single voting location on trees
• Multiple voting location problems
• An alternating heuristic for medianoid and centroid problems in the plane
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• On the Complexity of Some Common Geometric Location Problems
• A new alternating heuristic for the (r | p)–centroid problem on the plane