Steiner tree packing revisited (Q1935940): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot and Complement–A Heuristic for 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot and shift -- a mixed integer programming heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of formulations and a heuristic for packing Steiner trees in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Via Minimization with Pin Preassignments and Layer Preference / 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: Further facets / 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: Q2928707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits / 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: Q3210200 / 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: On Steiner trees and minimum spanning trees in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cut-based inequalities for capacitated network design polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank

Latest revision as of 05:40, 6 July 2024

scientific article
Language Label Description Also known as
English
Steiner tree packing revisited
scientific article

    Statements

    Steiner tree packing revisited (English)
    0 references
    0 references
    0 references
    20 February 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner tree packing
    0 references
    integer programming
    0 references
    grid graph
    0 references
    0 references
    0 references
    0 references
    0 references