Optimum path packing on wheels: The consecutive case

Beitrag in einer Fachzeitschrift

Details zur Publikation

Autor(en): Grötschel M, Martin A, Weismantel R
Zeitschrift: Computers & Mathematics With Applications
Jahr der Veröffentlichung: 1996
Band: 31
Seitenbereich: 23 - 35
ISSN: 0898-1221
Sprache: Englisch


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-Autoren / FAU-Herausgeber

Martin, Alexander Prof. Dr.
Lehrstuhl für Wirtschaftsmathematik

Autor(en) der externen Einrichtung(en)
Konrad-Zuse-Zentrum für Informationstechnik / Zuse Institute Berlin (ZIB)


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

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


Zuletzt aktualisiert 2018-07-08 um 16:08