Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large-scale symmetric travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing in grid graphs by cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner Trees: Separation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees: Polyhedral investigations / 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: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank

Latest revision as of 13:49, 24 May 2024

scientific article
Language Label Description Also known as
English
Packing Steiner trees: A cutting plane algorithm and computational results
scientific article

    Statements

    Packing Steiner trees: A cutting plane algorithm and computational results (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 January 1997
    0 references
    0 references
    branch-and-cut
    0 references
    cutting plane algorithm
    0 references
    Steiner tree packing problem
    0 references
    switchbox routing
    0 references
    VLSI-design
    0 references