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

DOI10.1007/S11750-013-0275-YzbMATH Open1297.90069OpenAlexW2114002675MaRDI QIDQ456933FDOQ456933

A. V. Plyasunov, Yury Kochetov, I. Davydov

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

Recommendations

• A local search heuristic for the \((r| p)\)-centroid problem in the plane
• \((r,p)\)-centroid problems on paths and trees
• A new alternating heuristic for the \((r|p)\)-centroid problem on the plane
• VNS heuristic for the \((r|p)\)-centroid problem on the plane
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem

zbMATH Keywords

bilevel programmingcompetitive locationleader-follower problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (25)

• The (1|1)-Centroid Problem in the Plane with Distance Constraints
• Stability Analysis for Pricing
• A bilevel planning model for public-private partnership
• Bilevel competitive facility location and pricing problems
• VNS heuristic for the \((r|p)\)-centroid problem on the plane
• A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
• The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints
• Competitive location in cognitive radio networks
• Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
• Generalized \(p\)-center problems: Complexity results and approximation algorithms
• Exact method for the capacitated competitive facility location problem
• On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem
• A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand
• Un nuevo resultado sobre la complejidad del problema delP-centro
• Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem
• An exact method for the discrete \((r|p)\)-centroid problem
• The multilevel facility location and pricing problems: the computational complexity and the stability analysis
• Computational complexity of the discrete competitive facility location problem
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• A local search heuristic for the \((r| p)\)-centroid problem in the plane
• On solving the planar \(k\)-centrum problem with Euclidean distances
• \((r,p)\)-centroid problems on paths and trees
• Comparison of models of planning public-private partnership
• \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario
• \(\mathsf{W[1]}\)-hardness of the \(k\)-center problem parameterized by the skeleton dimension

This page was built for publication: On the complexity of the \((r|p)\)-centroid problem in the plane

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