Obstacle-Aware Longest-Path Routing with Parallel Constraint Programming Solvers
碩士 === 元智大學 === 資訊工程學系 === 100 === The longest-path routing problem, which can arise in the design of high-performance printed circuit boards (PCBs), has been proven to be NP-hard. In this thesis, we propose a constraint programming (CP) formulation to the gridded longest-path routing problem, which...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/51779252921903988436 |