Routing in grid graphs by cutting planes

DOI10.1007/BF01432359zbMath0838.90126OpenAlexW2080641818MaRDI QIDQ4845139

Robert Weismantel, Martin Grötschel, Alexander Martin

Publication date: 30 May 1996

Published in: [https://portal.mardi4nfdi.de/entity/Q4289815 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 algorithmSteiner treeswitchbox routingcutting plane algorithmweighted routingrouting problem in VLSI-design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Packing Steiner trees: Polyhedral investigations, Packing Steiner trees: A cutting plane algorithm and computational results, Switchbox routing in VLSI design: Closing the complexity gap

Cites Work

• Multicommodity flows in graphs
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Unnamed Item
• Unnamed Item