Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
From MaRDI portal
Publication:814956
DOI10.1007/S10852-004-4072-3zbMath1093.90004OpenAlexW2084300619MaRDI QIDQ814956
Abdulrahman Al-khedhairi, Said Salhi
Publication date: 8 February 2006
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-004-4072-3
Minimax problems in mathematical programming (90C47) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Boolean programming (90C09)
Related Items (9)
Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem ⋮ The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory ⋮ A scalable exact algorithm for the vertex \(p\)-center problem ⋮ Double bound method for solving the \(p\)-center location problem ⋮ An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem ⋮ A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem ⋮ Exact solution approaches for the discrete α‐neighbor p‐center problem ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
Uses Software
Cites Work
- A note on solving large p-median problems
- A New Formulation and Resolution Method for the p-Center Problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- TSPLIB—A Traveling Salesman Problem Library
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- The m-Center Problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
