The Steiner tree problem I: Formulations, compositions and extension of facets

Mathematical Programming

Volumn 64, Issue 1-3, 1994, Pages 209-229

  Chopra, Sunil ^a   Rao, M R ^b  

^a NORTHWESTERN UNIVERSITY   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Facets; Polyhedron; Projection; Steiner tree

Indexed keywords

GEOMETRY; GRAPH THEORY; MATHEMATICAL PROGRAMMING; SET THEORY; TREES (MATHEMATICS);

FACETS; INTEGER PROGRAMMING FORMULATIONS; LP RELAXATION; POLYHEDRON; PROJECTION; STEINER TREE;

COMPUTATIONAL COMPLEXITY;

EID: 34249770791     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01582573     Document Type: Article

References (21)

1. Rectilinear Steiner trees: Efficient special case algorithms
2. An integer linear programming approach to the Steiner problem in graphs
3. New aspects of polyhedral theory
4. The perfectly matchable subgraph polytope of a bipartite graph
5. On the spanning tree polyhedron
6. Solving a Steiner tree problem on a graph using branch and cut
7. The travelling salesman problem on a graph and some related integer polyhedra
8. The Steiner problem in graph
9. Blocking and anti-blocking pairs of polyhedra
10. Steiner problem in graphs and its implications
11. On Steiner minimal trees with rectilinear distance
12. Steiner trees, partial 2-trees and minimum IFI Networks
13. Steiner trees, connected domination and strongly chordal graphs
14. Steiner problem in network: A survey
15. A dual ascent approach for Steiner tree problems on a directed graph