A Genetic Algorithm for Maximum Edge-Disjoint Paths Problem and Its Extension to Routing and Wavelength Assignment Problem
博士 === 國立交通大學 === 運輸與物流管理學系 === 102 === Optimization problems concerning edge-disjoint paths in a given graph have attracted considerable attention for decades. Lots of applications can be found in the areas of call admission control, real-time communication, VLSI (Very-large-scale integration) layo...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/91113793454916747595 |