A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SONET / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076448349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated <i>m</i>-Ring-Star Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymmetric representatives formulation for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Formulations for the Ring Spur Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral results for two-connected networks with bounded rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-connected networks with rings of bounded cardinality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Two-Connected Network with Bounded Meshes Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SONET/SDH ring assignment with capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Subtour Elimination Constraints and Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic procedure for the capacitated \(m\)-ring-star problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / rank
 
Normal rank

Latest revision as of 18:10, 6 July 2024

scientific article; zbMATH DE number 6195676
Language Label Description Also known as
English
A branch‐and‐cut algorithm for the ring spur assignment problem
scientific article; zbMATH DE number 6195676

    Statements

    A branch‐and‐cut algorithm for the ring spur assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    survivable network design
    0 references
    NP-hardness proof
    0 references
    IP formulation
    0 references
    branch-and-cut algorithm
    0 references
    0 references