New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems

DOI10.1016/j.cor.2008.03.009zbMath1177.90246MaRDI QIDQ959511

Reuven Chen, Doron Chen

Publication date: 17 December 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.03.009

zbMATH Keywords

relaxation; \(p\)-center

Mathematics Subject Classification ID

90B80: Discrete location and assignment

Related Items

Bee colony optimization for the \(p\)-center problem, A relaxation-based algorithm for solving the conditional \(p\)-center problem

Uses Software

• TSPLIB
• CPLEX
• OR-Library
• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The multi-facility min-max Weber problem
• A note on solving large p-median problems
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• Location science research: a review
• Dominant, an algorithm for the \(p\)-center problem.
• A New Formulation and Resolution Method for the p-Center Problem
• On the Complexity of Some Common Geometric Location Problems
• The p-Centre Problem-Heuristic and Optimal Algorithms
• An Algorithm for the p-Center Problem in the Plane
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• The p-center location problem in an area
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• Solving the continuous space p-centre problem: planning application issues
• The m-Center Problem
• The Location of Emergency Service Facilities