Packing Steiner trees: Separation algorithms

Journal article


Publication Details

Author(s): Grötschel M, Martin A, Weismantel R
Journal: SIAM Journal on Discrete Mathematics
Publication year: 1996
Volume: 9
Pages range: 233 - 257
ISSN: 0895-4801
Language: English


Abstract


We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that the terminal pairs are in consecutive order, then a path packing, i.e., a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides a complete and nonredundant description of the path packing polytope, which is the convex hull of all incidence vectors of path packings and their supersets.



FAU Authors / FAU Editors

Martin, Alexander Prof. Dr.
Economics - Discrete Optimization - Mathematics (EDOM)


External institutions with authors

Konrad-Zuse-Zentrum für Informationstechnik / Zuse Institute Berlin (ZIB)


How to cite

APA:
Grötschel, M., Martin, A., & Weismantel, R. (1996). Packing Steiner trees: Separation algorithms. SIAM Journal on Discrete Mathematics, 9, 233 - 257.

MLA:
Grötschel, Martin, Alexander Martin, and Robert Weismantel. "Packing Steiner trees: Separation algorithms." SIAM Journal on Discrete Mathematics 9 (1996): 233 - 257.

BibTeX: 

Last updated on 2018-08-08 at 03:51