ZIB

Treffer pro Seite

Treffer 1 - 1 | 1 Treffer

Alles auswählen Exportieren

Unbekannt

The Steiner Tree Packing Problem in VLSI-Design. (1994)

Grötschel, Martin ; Martin, Alexander ; Weismantel, Robert

zur Merkliste hinzufügen auf der Merkliste

Details

Publikationsdatum: 2014-02-26

Beschreibung: 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.

Schlagwort(e): ddc:000

Sprache: Englisch

Materialart: reportzib , doc-type:preprint

Format: application/postscript

Format: application/pdf

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

OPUS

PDF

Überblick

Treffer 1 - 1 | 1 Treffer