Algorithm of global escape routing problem based on linear programming
As a key part of PCB design, the ordered escape routing problem is a special NP-hard problem, which has been studied extensively in recent years. In the traditional method, both ILP method and the heuristic algorithms based on ripping-up and rerouting are only applicable to small-scaled pin arrays w...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Chinês |
| منشور في: |
National Computer System Engineering Research Institute of China
2023-01-01
|
| سلاسل: | Dianzi Jishu Yingyong |
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://www.chinaaet.com/article/3000157987 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|