Facility dispersion and remote subgraphs (Q5054806): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved non-approximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete p-dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical models for locating undesirable facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison Of Four Models For dispersing Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Network Location Problems with Distance Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Special Case Algorithms for Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obnoxious Facility Location on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximal dispersion problem and the ``first point outside the neighbourhood'' heuristic / rank
 
Normal rank

Latest revision as of 02:08, 31 July 2024

scientific article; zbMATH DE number 7631745
Language Label Description Also known as
English
Facility dispersion and remote subgraphs
scientific article; zbMATH DE number 7631745

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references