A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2022.02.016 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: MOD-DIST / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MENU-OKF / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4211117630 / 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: Dominant, an algorithm for the \(p\)-center problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double bound method for solving the \(p\)-center location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scalable exact algorithm for the vertex \(p\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on Benders decomposition applied to fixed-charge network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network and Discrete Location: Models, Algorithms, and Applications, Second Edition / rank
 
Normal rank
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: Approximation algorithm for the kinetic robust \(k\)-center problem / 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: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems / 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: Location Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust vertex \(p\)-center model for locating urgent relief distribution centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>m</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Benders decomposition algorithm: a literature review / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3094957 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2022.02.016 / rank
 
Normal rank

Latest revision as of 16:26, 19 December 2024

scientific article
Language Label Description Also known as
English
A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
scientific article

    Statements

    A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (English)
    0 references
    0 references
    0 references
    10 June 2022
    0 references
    location
    0 references
    \(p\)-center problem
    0 references
    integer programming formulation
    0 references
    lifting
    0 references
    min-max objective
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers