A three-step heuristic algorithm for PLA column folding is presented, which is significantly faster than the earlier works and provides nearly optimal results. The three steps are (i) min-cut partition of vertices in ...
详细信息
A three-step heuristic algorithm for PLA column folding is presented, which is significantly faster than the earlier works and provides nearly optimal results. The three steps are (i) min-cut partition of vertices in the column intersection graph, (ii) determination of product order using Fiduccia's min-net cut algorithm, and (iii) head-tail pairing for deciding column folding pairs.
暂无评论