Dominant, an algorithm for the \(p\)-center problem. (Q1811146): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A note on solving large p-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially bounded algorithms for locatingp-centers on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—A Computational Survey of Methods for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The p-Centre Problem-Heuristic and Optimal Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case analysis of a class of set covering heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding P-centers on a weighted tree (for relatively small P) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—The Discrete Anti-P-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>m</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods for the<i>p</i>-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic for large set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid heuristics for minimum cardinality set covering problems / rank
 
Normal rank

Revision as of 16:30, 5 June 2024

scientific article
Language Label Description Also known as
English
Dominant, an algorithm for the \(p\)-center problem.
scientific article

    Statements

    Dominant, an algorithm for the \(p\)-center problem. (English)
    0 references
    0 references
    0 references
    0 references
    10 June 2003
    0 references
    Location
    0 references
    \(p\)-center
    0 references
    Set covering
    0 references
    Heuristics
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers