Reactive Search for Traffic Grooming in WDM Networks
暂无分享,去创建一个
[1] S.,et al. An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .
[2] Roberto Battiti,et al. Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.
[3] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[4] Brian Kernighan,et al. An efficient heuristic for partitioning graphs , 1970 .
[5] Eytan Modiano,et al. Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic , 2000, IEEE Journal on Selected Areas in Communications.
[6] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[7] Roberto Battiti,et al. Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning , 1999, IEEE Trans. Computers.
[8] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[9] A.L. Chiu,et al. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.
[10] Peng-Jun Wan,et al. Grooming of arbitrary traffic in SONET/WDM BLSRs , 2000, IEEE Journal on Selected Areas in Communications.