Routing in grid graphs by cutting planes

In this paper we study the following problem, which we call the weighted routing problem. Let be given a graphG = (V, E) with non-negative edge weightswe ∈ ℝ+ and letN,N ≥ 1, be a list of node sets. The weighted routing problem consists in finding mutually disjoint edge setsS1,...,SN such that, for eachk ∈ {1, ...,N}, the subgraph (V(Sk),Sk) contains an [s, t]-path for alls, t ∈ Tk and 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 describe 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 switchbox routing 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.