A branch-and-price algorithm for switch-box routing (Q4785215): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees: A cutting plane algorithm and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees: Polyhedral investigations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree packing problem in VLSI design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank

Latest revision as of 09:51, 5 June 2024

scientific article; zbMATH DE number 1847182
Language Label Description Also known as
English
A branch-and-price algorithm for switch-box routing
scientific article; zbMATH DE number 1847182

    Statements

    A branch-and-price algorithm for switch-box routing (English)
    0 references
    0 references
    0 references
    0 references
    17 December 2002
    0 references
    integer programming
    0 references
    VLSI-routing
    0 references
    Steiner packing
    0 references
    VLSI design
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references