The Steiner Tree Packing Problem in VLSI-Design

Journal article


Publication Details

Author(s): Grötschel M, Martin A, Weismantel R
Journal: Mathematical Programming
Publication year: 1997
Volume: 78
Pages range: 265 - 281
ISSN: 0025-5610
Language: English


Abstract


In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we developed and implemented for these two models. We report on computational experiments using standard test instances. Our codes are able to determine optimum solutions in most cases, and in particular, we can show that some of the instances have no feasible solution if Manhattan routing is used instead of knock-knee routing.



FAU Authors / FAU Editors

Martin, Alexander Prof. Dr.
Economics - Discrete Optimization - Mathematics (EDOM)


External institutions with authors

Konrad-Zuse-Zentrum für Informationstechnik / Zuse Institute Berlin (ZIB)


How to cite

APA:
Grötschel, M., Martin, A., & Weismantel, R. (1997). The Steiner Tree Packing Problem in VLSI-Design. Mathematical Programming, 78, 265 - 281.

MLA:
Grötschel, Martin, Alexander Martin, and Robert Weismantel. "The Steiner Tree Packing Problem in VLSI-Design." Mathematical Programming 78 (1997): 265 - 281.

BibTeX: 

Last updated on 2018-10-08 at 05:25