A heuristic and an exact method for the gate matrix connection cost minimization problem
In many applications, a sequencing of patterns (electronic circuit nodes, cutting patterns, product orders, etc.) has to be found in order to optimize some given objective function, giving rise to the so-called open stack problems. We focus on a problem related to the optimization of gate matrix lay...
Main Authors: | , , , , , |
---|---|
Format: | Journal article |
Published: |
2013
|