Obstacle-aware routing problem in a rectangular mesh network
In an automatic design process for very large scale integration/printed circuit board (VLSI/PCB), routing problem is one of the most important and crucial part after components placement phase. This process is notoriously difficult, and a problem consists of a set of two-pin nets, is known to be NP-...
Saved in:
Main Authors: | Adzhar, Noraziah, Salleh, Shaharuddin |
---|---|
Format: | Article |
Published: |
Hikari Ltd.
2015
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/58679/ http://dx.doi.org/10.12988/ams.2015.411911 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2018) -
Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019) -
Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019) -
Simulated annealing technique for routing in a rectangular MESH network
by: Salleh, Shaharuddin, et al.
Published: (2014) -
An enhanced simulated annealing approach for cylindrical, rectangular mesh, and semi-diagonal torus network topologies
by: Adzhar, Noraziah
Published: (2015)