A branch-and-price algorithm for switch-box routing

DOI10.1002/net.10029zbMath1064.68004OpenAlexW2056884147MaRDI QIDQ4785215

David Grove Jørgensen, Morten Meyling

Publication date: 17 December 2002

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10029

zbMATH Keywords

integer programmingVLSI designSteiner packingVLSI-routing

Mathematics Subject Classification ID

Integer programming (90C10) Nonnumerical algorithms (68W05) Mathematical problems of computer architecture (68M07)

Related Items (1)

Mathematical methods for physical layout of printed circuit boards: an overview

Uses Software

• LEDA
• SoPlex
• CPLEX
• BEAVER

Cites Work

• Unnamed Item
• The Steiner tree packing problem in VLSI design
• Packing Steiner trees: Polyhedral investigations
• Packing Steiner trees: A cutting plane algorithm and computational results
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
• The steiner problem in graphs

This page was built for publication: A branch-and-price algorithm for switch-box routing