## Routing in Grid Graphs by Cutting Planes.

Please always quote using this URN: urn:nbn:de:0297-zib-967

- {\def\N{{\cal N}} \def\R{\hbox{\rm I\kern-2pt R}} \def\MN{{\rm I\kern-2pt N}} In this paper we study the following problem, which we call the weighted routing problem. Let be given a graph $G=(V,E)$ with non-negative edge weights $w_e\in\R_+$ and integer edge capacities $c_e\in\MN$ and let $\N=\{T_1,\ldots,T_N\}$, $N\ge 1$, be a list of node sets. The weighted routing problem consists in finding edge sets $S_1,\ldots,S_N$ such that, for each $k\in\{1,\ldots,N\}$, the subgraph $(V(S_k),S_k)$ contains an $[s,t]$-path for all $s,t\in T_k$, at most $c_e$ of these edge sets use edge $e$ for each $e\in E$, and such that the sum of the weights of the edge sets is minimal. Our motivation for studying this problem arises from the routing problem in VLSI-design, where given sets of points have to be connected by wires. We consider the weighted routing problem from a polyhedral point of view. We define an appropriate polyhedron and try to (partially) describe this polyhedron by means of inequalities. We briefly sketch our separation algorithms for some of the presented classes of inequalities. Based on these separation routines we have implemented a branch and cut algorithm. Our algorithm is applicable to an important subclass of routing problems arising in VLSI-design, namely to problems where the underlying graph is a grid graph and the list of node sets is located on the outer face of the grid. We report on our computational experience with this class of problem instances.}

Author: | Martin Grötschel, Alexander Martin, Robert Weismantel |
---|---|

Document Type: | ZIB-Report |

Tag: | Steiner tree; Steiner tree packing; cutting plane algorithm; routing in VLSI-design |

Date of first Publication: | 1992/12/02 |

Series (Serial Number): | ZIB-Report (SC-92-26) |

ZIB-Reportnumber: | SC-92-26 |

Published in: | Appeared in: Integer Programming and Combinatorial Optimization - IPCO-03. Proc. of a Conf., Erice, April 29 - May 1, 1993. Core, Louvain-la-Neuve, Belgium, 1993, pp. 447-461. An extended version appeared in: ZOR - Mathematical Methods of Operations Research 41 (1995) pp. 255-275 |