The Mixed Center Location Problem (Q2958327): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5501789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-linear algorithm for the planar 2-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: More planar two-center algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for the two-center decision problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding tailored partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete 2-center problem / 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: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The slab dividing approach to solve the Euclidean \(P\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean k-Supplier Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi Diagrams and Delaunay Triangulations / rank
 
Normal rank

Latest revision as of 08:31, 13 July 2024

scientific article
Language Label Description Also known as
English
The Mixed Center Location Problem
scientific article

    Statements

    Identifiers

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