Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-010-0375-5 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SNDlib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SteinLib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-010-0375-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970767312 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56977123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing the push-relabel method for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Formulations for 2-Node-Connected Steiner Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining optimal <i>k</i> -cardinality trees fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalog of steiner tree formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Survivable Networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong lower bounds for the prize collecting Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for network design problems with connectivity requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight two-connected spanning networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the Steiner problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Graphs, with an Application to a Problem of Traffic Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of survivable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-010-0375-5 / rank
 
Normal rank

Latest revision as of 12:41, 19 December 2024

scientific article
Language Label Description Also known as
English
Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
scientific article

    Statements

    Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2010
    0 references
    graph orientation
    0 references
    2-connected networks
    0 references
    ILP formulations
    0 references
    branch and cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers