The Steiner tree polytope and related polyhedra (original) (raw)
Related papers
Discrete Applied Mathematics, 2001
Some Formulations for the Group Steiner Tree Problem
Electronic Notes in Discrete Mathematics, 2004
Polyhedral Approaches for the Steiner Tree Problem on Graphs
Combinatorial Optimization, 2001
Steiner k-edge connected subgraph polyhedra
Journal of combinatorial optimization, 2000
A partition-based relaxation for Steiner trees
Mathematical Programming, 2011
Packing Steiner Trees: Further Facets
European Journal of Combinatorics, 1996
The multi-weighted Steiner tree problem: A reformulation by intersection
Computers & Operations Research, 2008
Characterization of facets of the hop constrained chain polytope via dynamic programming
Discrete Applied Mathematics, 2014
Spanning Trees in Hypergraphs with Applications to Steiner Trees
On the euclidean bottleneck full Steiner tree problem
Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
The Euclidean Bottleneck Full Steiner Tree Problem
Algorithmica, 2013
New real-world instances for the steiner tree problem in graphs
Solving Steiner tree problems in graphs to optimality
1998
New Benchmark Instances for the Steiner Problem in Graphs
2001
Directed Steiner Tree Problem on a Graph: Models, Relaxations, and Algorithms
The dominant of the 2-connected-Steiner-subgraph polytope for W4-free graphs
Discrete Applied Mathematics, 1996
Mathematical Programming, 2009
An Exact Algorithm for Steiner Tree Problem on Graphs
International Journal of Computers Communications & Control, 2006
Minimum Weight Convex Steiner Partitions
Algorithmica, 2009
Facets of the linear ordering polytope: A unification for the fence family through weighted graphs
Journal of Mathematical Psychology, 2006
On the star forest polytope for trees and cycles
RAIRO - Operations Research
Simple and fast reoptimizations for the Steiner tree problem
Packing Steiner Trees: Separation Algorithms
SIAM Journal on Discrete Mathematics, 1996
Improved Steiner tree algorithms for bounded treewidth
Journal of Discrete Algorithms, 2012
Polynomially solvable special cases of the Steiner problem in planar networks
Annals of Operations Research, 1991
Directed Steiner problems with connectivity constraints
Discrete Applied Mathematics, 1993
Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
Discrete Applied Mathematics
The Steiner connectivity problem
Mathematical Programming, 2012
An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem
Comb Inequalities for the Degree Constrained Minimum Spanning Tree Problem
2012