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

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

Doron Chen, Reuven 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

Discrete location and assignment (90B80)

Related Items (22)

The mixed center location problem ⋮ The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory ⋮ A scalable exact algorithm for the vertex \(p\)-center problem ⋮ Robust vertex \(p\)-center model for locating urgent relief distribution centers ⋮ An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ The multi-period \(p\)-center problem with time-dependent travel times ⋮ A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem ⋮ An iterative exact algorithm for the weighted fair sequences problem ⋮ Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions ⋮ Exact solution approaches for the discrete α‐neighbor p‐center problem ⋮ Bee colony optimization for the \(p\)-center problem ⋮ The complete vertex \(p\)-center problem ⋮ The maximin gradual cover location problem ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane ⋮ A relaxation-based algorithm for solving the conditional \(p\)-center problem ⋮ Data Exploration by Representative Region Selection: Axioms and Convergence ⋮ Solving multiple facilities location problems with separated clusters ⋮ The conditional \(p\)-dispersion problem ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem ⋮ Continuous Center Problems ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants

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

This page was built for publication: New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems