Dominant, an algorithm for the \(p\)-center problem.

DOI10.1016/S0377-2217(02)00464-2zbMath1035.90037OpenAlexW2046146164MaRDI QIDQ1811146

L. Aloi, C. Caruso, Alberto Colorni

Publication date: 10 June 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00464-2

zbMATH Keywords

HeuristicsLocation\(p\)-centerSet covering

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (10)

A scalable exact algorithm for the vertex \(p\)-center 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 ⋮ Bee colony optimization for the \(p\)-center problem ⋮ Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane ⋮ New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems ⋮ Insertion heuristics for central cycle problems ⋮ Data Exploration by Representative Region Selection: Axioms and Convergence ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on solving large p-median problems
• An efficient heuristic for large set covering problems
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Heuristic methods for thep-center problem
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• Hybrid heuristics for minimum cardinality set covering problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Polynomially bounded algorithms for locatingp-centers on a tree
• Worst case analysis of a class of set covering heuristics
• Note—A Computational Survey of Methods for the Set Covering Problem
• Technical Note—The Discrete Anti-P-Center Problem
• The m-Center Problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Dominant, an algorithm for the \(p\)-center problem.