On computational complexity of a detailed routing problem in two dimensional FPGAs.
Yu-Liang WuShuji TsukiyamaMalgorzata Marek-SadowskaPublished in: Great Lakes Symposium on VLSI (1994)
Keyphrases
- routing problem
- computational complexity
- vehicle routing problem
- three dimensional
- route optimization
- multi period
- routing algorithm
- vehicle routing
- multicommodity flow
- vehicle routing problem with time windows
- np hard
- np complete
- shortest path
- traveling salesman problem
- real time
- special case
- metaheuristic
- set partitioning
- evolutionary algorithm
- genetic algorithm