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

DOI10.1002/NET.10029MaRDI QIDQ4785215zbMATH OpenOpenAlexFDO

Authors 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 programmingSteiner packingVLSI designVLSI-routing

Mathematics Subject Classification ID

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

Recommendations

• The Steiner tree packing problem in VLSI design
• A branch-and-price algorithm for the Steiner tree packing problem.
• Packing Steiner trees: A cutting plane algorithm and computational results
• Routing in grid graphs by cutting planes
• Shortest paths and Steiner trees in VLSI routing

Cites work

• A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
• scientific article; zbMATH DE number 3677874 (Why is no real title available?)
• Packing Steiner trees: A cutting plane algorithm and computational results
• Packing Steiner trees: Polyhedral investigations
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• The steiner problem in graphs
• The Steiner tree packing problem in VLSI design

Cited in

(4)

• Branch-and-price algorithm for a multicast routing problem
• Peel-the-box: a concept of switch-box routing and tractable problems
• A branch-and-price algorithm for the Steiner tree packing problem.
• Mathematical methods for physical layout of printed circuit boards: an overview

Describes a project that uses

Uses Software

• CPLEX
• SoPlex
• LEDA
• BEAVER

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

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