Dominant, an algorithm for the \(p\)-center problem.
type: Item
instance of: scholarly article
title: Dominant, an algorithm for the \(p\)-center problem.
zbMATH Open document ID: 1035.90037
DOI: 10.1016/S0377-2217(02)00464-2
author: C. Caruso
author: L. Aloi
author: Alberto Colorni
published in: European Journal of Operational Research
publication date: 2003-06-10T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1925365
zbMATH Keywords: Location
zbMATH Keywords: \(p\)-center
zbMATH Keywords: Set covering
zbMATH Keywords: Heuristics
describes a project that uses: MENU-OKF
describes a project that uses: OR-Library
describes a project that uses: SITATION
describes a project that uses: MOD-DIST
MaRDI profile type: Publication
cites work: A note on solving large p-median problems
cites work: Polynomially bounded algorithms for locatingp-centers on a tree
cites work: Note—A Computational Survey of Methods for the Set Covering Problem
cites work: Q4857376
cites work: The p-Centre Problem-Heuristic and Optimal Algorithms
cites work: Q4198056
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: Q3993417
cites work: Q3316922
cites work: Worst case analysis of a class of set covering heuristics
cites work: Algorithms for finding P-centers on a weighted tree (for relatively small P)
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: Technical Note—The Discrete Anti-P-Center Problem
cites work: The m-Center Problem
cites work: Heuristic methods for thep-center problem
cites work: An efficient heuristic for large set covering problems
cites work: Hybrid heuristics for minimum cardinality set covering problems
full work available at URL: s0377-2217(02)00464-2
OpenAlex ID: W2046146164
description: scientific article; zbMATH DE number 1925365