Optimum path packing on wheels: The consecutive case

DOI10.1016/0898-1221(96)00058-2MaRDI QIDQ1921239zbMATH OpenOpenAlexFDO

Authors Alexander Martin, Martin Grötschel, Robert Weismantel

Publication date 6 January 1997

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(96)00058-2

zbMATH Keywords

path packingrouting algorithmsVLSI designwheel

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35)

Recommendations

• Odd path packings
• On return path packing.
• Packing paths perfectly
• Path packing and a related optimization problem
• Wheel inequalities for stable set polytopes

Cites work

• scientific article; zbMATH DE number 4211829 (Why is no real title available?)
• scientific article; zbMATH DE number 16298 (Why is no real title available?)
• Multicommodity flows in planar graphs
• Network flows. Theory, algorithms, and applications.
• Packing Steiner trees: A cutting plane algorithm and computational results
• Packing Steiner trees: Polyhedral investigations
• Routing through a Dense Channel with Minimum Total Wire Length

This page was built for publication: Optimum path packing on wheels: The consecutive case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1921239)