A rounding and clustering-based exact algorithm for the p-center problem

DOI10.1016/J.COR.2025.107185MaRDI QIDQ6891365zbMATH OpenFDO

Authors Zacharie Ales, Cristian Duran-Mateluna, Sourour Elloumi

Publication date 2 December 2025

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

Full work available at URL https://doi.org/10.1016/J.COR.2025.107185

zbMATH Keywords

\(p\)-center problemclustering algorithmdiscrete locationdistance rounding

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A new formulation and resolution method for the p-center problem
• A scalable exact algorithm for the vertex \(p\)-center problem
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Compact MILP formulations for the \(p\)-center problem
• Double bound method for solving the p-center location problem
• Enhancements to two exact algorithms for solving the vertex P-center problem
• scientific article; zbMATH DE number 4059089 (Why is no real title available?)
• Location science
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• The m-Center Problem
• The m-Center Problem: Minimax Facility Location
• TSPLIB—A Traveling Salesman Problem Library

This page was built for publication: A rounding and clustering-based exact algorithm for the p-center problem

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