The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a relatively simple algorithm is presented. It is shown that instances containing up to 60 cells can be solved optimally by using a commercial integer linear programming solver embedded within an iterative scheme.
Paru en mai 2003 , 13 pages
Ce cahier a été révisé en juin 2004