Improving linear programming approaches for the steiner tree problem

Authors:
Ernst Althaus;Tobias Polzin;Siavash Vahdati Daneshmand
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany;Theoretische Informatik, Universität Mannheim, Mannheim, Germany
Venue:
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Year:
2003

Citing 9
Cited 5

Introduction to algorithms

Introduction to algorithms
The Steiner tree problem I: formulations, compositions and extension of facets

Mathematical Programming: Series A and B
A comparison of Steiner tree relaxations

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Improved algorithms for the Steiner problem in networks

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
TSP Cuts Which Do Not Conform to the Template Paradigm

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
A Primal Approach to the Stable Set Problem

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Extending Reduction Techniques for the Steiner Tree Problem

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Finding Cuts in the TSP (A preliminary report)

Finding Cuts in the TSP (A preliminary report)
On Steiner trees and minimum spanning trees in hypergraphs

Operations Research Letters

Approaches to the Steiner Problem in Networks

Algorithmics of Large and Complex Networks
Approximation of octilinear steiner trees constrained by hard and soft obstacles

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Local cuts revisited

Operations Research Letters
Solving the quorumcast routing problem by constraint programming

Constraints
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two theoretically interesting and empirically successful techniques for improving the linear programming approaches, namely graph transformation and local cuts, in the context of the Steiner problem. We show the impact of these techniques on the solution of the largest benchmark instances ever solved.