The Steiner tree packing problem in VLSI design
Grötschel, M.
Martin, A. (Konrad-Zuse-Zentrum für Informationstechnik Berlin)
Weismantel, R.

Data: 1997
Resum: 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. .
Drets: Tots els drets reservats
Llengua: Anglès
Document: article ; recerca ; Versió publicada
Matèria: Steiner tree packing ; Routing in VLSI design ; Switchbox routing ; Cutting plane algorithm
Publicat a: Mathematical Programming, vol. 78 n. 2 (1997) p. 265-281, ISSN 0025-5610

17 p, 989.4 KB
 Accés restringit a la UAB

El registre apareix a les col·leccions:
Articles > Articles de recerca
Articles > Articles publicats

 Registre creat el 2006-03-13, darrera modificació el 2021-07-24

   Favorit i Compartir