The Steiner tree packing problem in VLSI design

@article{Grtschel1997TheST,
  title={The Steiner tree packing problem in VLSI design},
  author={Martin Gr{\"o}tschel and Alexander Martin and Robert Weismantel},
  journal={Math. Program.},
  year={1997},
  volume={77},
  pages={265-281}
}
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 switch-box 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… CONTINUE READING