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 threesteps 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 threesteps 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.
暂无评论