An efficient algorithm for optimal pairing and chaining in layout generation

Most published chaining algorithms require a previous pairing step. Since an heuristical approach is used for pairing, the optimal pairing is not always found. A new algorithm is presented that combines pairing and chaining into one single step. This approach is based on Chi-Yi-Hwang et al.´s (1990) algorithm. Extended definitions are given to introduce the new features. A new upper bound on the number of possible abutments reduces the search tree. Optimal results are always reached and execution time is maintained low