Resultats globals: 1 registres trobats en 0.03 segons.
Articles, 1 registres trobats
Articles 1 registres trobats  
1.
17 p, 989.4 KB The Steiner tree packing problem in VLSI design / Grötschel, M. ; Martin, A. ; Weismantel, R.
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. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 265-281  
 Accés restringit a la UAB

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.