Grötschel M, Martin A, Weismantel R (1996)
Publication Language: English
Publication Type: Journal article
Publication year: 1996
Publisher: Elsevier
Book Volume: 17
Pages Range: 39 - 52
In this paper we continue the investigations in [3] for the Steiner tree packing polyhedron. We present several new classes of valid inequalities and give sufficient (and necessary) conditions for these inequalities to be facet-definining. It is intended to incorporate these inequalities into an existing cutting plane algorithm that is applicable to practical problems arising in the design of electronic curcuits.
APA:
Grötschel, M., Martin, A., & Weismantel, R. (1996). Packing Steiner trees: Further facets. European Journal of Combinatorics, 17, 39 - 52.
MLA:
Grötschel, Martin, Alexander Martin, and Robert Weismantel. "Packing Steiner trees: Further facets." European Journal of Combinatorics 17 (1996): 39 - 52.
BibTeX: Download