Some formulations for the group Steiner tree problem (Q2500536): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving group Steiner problems as Steiner problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear group Steiner trees and applications in VLSI design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the generalized Steiner tree polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The class Steiner minimal tree problem: A lower bound and test problem generation / rank
 
Normal rank

Latest revision as of 18:21, 24 June 2024

scientific article
Language Label Description Also known as
English
Some formulations for the group Steiner tree problem
scientific article

    Statements

    Some formulations for the group Steiner tree problem (English)
    0 references
    0 references
    17 August 2006
    0 references
    combinatorial optimization
    0 references
    polyhedral combinatorics
    0 references
    integer programming formulations
    0 references
    branch-and-cut algorithms
    0 references

    Identifiers