Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3425132 / 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: Using a hybrid of exact and genetic algorithms to design survivable networks / 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: 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: 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 / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Latest revision as of 00:54, 29 June 2024

scientific article; zbMATH DE number 5498455
Language Label Description Also known as
English
Strong Formulations for 2-Node-Connected Steiner Network Problems
scientific article; zbMATH DE number 5498455

    Statements

    Strong Formulations for 2-Node-Connected Steiner Network Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 January 2009
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers