The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Rectilinear steiner trees: Efficient special-case algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming approach to the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfectly matchable subgraph polytope of a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning tree polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Steiner Tree Problem on a Graph Using Branch and Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem on a graph and some related integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner's problem in graphs and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner Minimal Trees with Rectilinear Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, connected domination and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / 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 17:16, 22 May 2024

scientific article
Language Label Description Also known as
English
The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
scientific article

    Statements

    The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (English)
    0 references
    0 references
    0 references
    10 August 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    facets
    0 references
    projection
    0 references
    Steiner tree problem
    0 references
    polyhedra
    0 references
    LP-relaxation
    0 references