Routing in grid graphs by cutting planes

DOI10.1007/BF01432359MaRDI QIDQ4845139zbMATH OpenOpenAlexFDO

Authors Martin Grötschel, Alexander Martin, Robert Weismantel

Publication date 30 May 1996

Published in ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01432359

zbMATH Keywords

branch and cut algorithmcutting plane algorithmrouting problem in VLSI-designSteiner treeswitchbox routingweighted routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1263288
• Publication:3210199
• The Steiner tree packing problem in VLSI design
• Routing through a generalized switchbox
• scientific article; zbMATH DE number 3932954

Cites work

• scientific article; zbMATH DE number 16298 (Why is no real title available?)
• scientific article; zbMATH DE number 108281 (Why is no real title available?)
• Multicommodity flows in graphs
• The Rectilinear Steiner Tree Problem is NP-Complete

Cited in

(8)

• Switchbox routing in VLSI design: Closing the complexity gap
• Packing Steiner trees: Polyhedral investigations
• Packing Steiner trees: A cutting plane algorithm and computational results
• scientific article; zbMATH DE number 4191147 (Why is no real title available?)
• scientific article; zbMATH DE number 1263288 (Why is no real title available?)
• A branch-and-price algorithm for switch-box routing
• A cutting plane algorithm for the general routing problem
• Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI

This page was built for publication: Routing in grid graphs by cutting planes

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