Fast heuristics for large scale covering-location problems (Q5959388): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The p-cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving an ambulance location model by tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tiling and routing heuristic for the screening of cytological samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4361181 / rank
 
Normal rank

Latest revision as of 00:02, 4 June 2024

scientific article; zbMATH DE number 1723867
Language Label Description Also known as
English
Fast heuristics for large scale covering-location problems
scientific article; zbMATH DE number 1723867

    Statements

    Fast heuristics for large scale covering-location problems (English)
    0 references
    0 references
    0 references
    0 references
    3 April 2002
    0 references
    0 references
    heuristics
    0 references
    set covering
    0 references
    location
    0 references
    graph colouring
    0 references
    cliques
    0 references