The Steiner tree packing problem in VLSI design

The Steiner tree packing problem in VLSI design

0.00 Avg rating0 Votes
Article ID: iaor1999855
Country: Netherlands
Volume: 78
Issue: 2
Start Page Number: 265
End Page Number: 281
Publication Date: Aug 1997
Journal: Mathematical Programming
Authors: , ,
Keywords: Steiner problem
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.

Reviews

Required fields are marked *. Your email address will not be published.