Optimum path packing on wheels: The consecutive case

Grötschel M, Martin A, Weismantel R (1996)

Publication Language: English

Publication Type: Journal article

Publication year: 1996

Journal

Computers & Mathematics with Applications Elsevier

Book Volume: 31

Pages Range: 23 - 35

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.

Authors with CRIS profile

Alexander Martin Economics - Discrete Optimization - Mathematics (EDOM)

Involved external institutions

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

How to cite

APA:

Grötschel, M., Martin, A., & Weismantel, R. (1996). Optimum path packing on wheels: The consecutive case. Computers & Mathematics with Applications, 31, 23 - 35.

MLA:

Grötschel, Martin, Alexander Martin, and Robert Weismantel. "Optimum path packing on wheels: The consecutive case." Computers & Mathematics with Applications 31 (1996): 23 - 35.

BibTeX: Download