Double bound method for solving the \(p\)-center location problem (Q336682): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A New Formulation and Resolution Method for the p-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Location Problems on Tree Networks / 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: The <i>m</i>-Center Problem / 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: Finite Dominating Sets for Network Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality and Distance Constraints for the Nonlinear <i>p</i>-Center Problem and Covering Problem on a Tree Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Complexity of <i>p</i>-Centre Problems / 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: A unified limited column generation approach for facility location problems on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: State of the Art—Location on Networks: A Survey. Part I: The <i>p</i>-Center and <i>p</i>-Median Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Center Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Canonical Representation of Simple Plant Location Problems and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimum Location of Multi-centres on a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>m</i>-Center Problem: Minimax Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancements to two exact algorithms for solving the vertex \(P\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank

Latest revision as of 22:42, 12 July 2024

scientific article
Language Label Description Also known as
English
Double bound method for solving the \(p\)-center location problem
scientific article

    Statements

    Double bound method for solving the \(p\)-center location problem (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    \(p\)-center location
    0 references
    multi-center location
    0 references
    covering location
    0 references
    minimax location
    0 references
    set covering
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers