Compact location problems (Q1391322): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding k points with minimum diameter and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Allocate Network Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved non-approximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static and dynamic algorithms for k-point clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple heuristic for the p-centre problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated nearest neighbors and finding minimal polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical models for locating undesirable facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(log <i>k</i>) approximation algorithm for the <i>k</i> minimum spanning tree problem in the plane / 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: Q3316922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-Nearest Neighbor Voronoi Diagrams in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / 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: Spanning Trees—Short or Small / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obnoxious Facility Location on Graphs / rank
 
Normal rank

Latest revision as of 13:16, 28 May 2024

scientific article
Language Label Description Also known as
English
Compact location problems
scientific article

    Statements

    Compact location problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 July 1998
    0 references
    0 references
    facility location
    0 references
    minimizing the diameter
    0 references
    minimizing the average distance
    0 references
    minimizing the variance
    0 references
    NP-hard
    0 references
    near-optimal solutions
    0 references