Local Search based on a New Neighborhood for Routing and Wavelength Assignment
暂无分享,去创建一个
[1] Zhipeng Lü,et al. Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem , 2016, J. Comb. Optim..
[2] Kumar N. Sivarajan,et al. Algorithms for routing and wavelength assignment based on solutions of LP-relaxations , 2001, IEEE Communications Letters.
[3] Celso C. Ribeiro,et al. A biased random-key genetic algorithm for routing and wavelength assignment , 2011, J. Glob. Optim..
[4] B. Mukherjee,et al. A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .
[5] Catherine Roucairol,et al. A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .
[6] Celso C. Ribeiro,et al. Efficient Implementations of Heuristics for Routing and Wavelength Assignment , 2008, WEA.
[7] Brigitte Jaumard,et al. On column generation formulations for the RWA problem , 2004, Discret. Appl. Math..
[8] Alexandre Xavier Martins,et al. Variable neighborhood descent with iterated local search for routing and wavelength assignment , 2012, Comput. Oper. Res..
[9] Wei Wu,et al. Double Configuration Checking in Stochastic Local Search for Satisfiability , 2014, AAAI.
[10] George N. Rouskas,et al. A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks , 1999 .
[11] Klaus Jansen,et al. The complexity of path coloring and call scheduling , 2001, Theor. Comput. Sci..
[12] Hai Jin,et al. Minimizing Inter-Server Communications by Exploiting Self-Similarity in Online Social Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.
[13] Biswanath Mukherjee,et al. A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..
[14] Celso C. Ribeiro,et al. Routing and wavelength assignment by partition colouring , 2006, Eur. J. Oper. Res..
[15] Susanne Biundo-Stephan,et al. Finding Optimal Solutions in HTN Planning - A SAT-based Approach , 2019, IJCAI.
[16] D. Manjunath,et al. Routing and wavelength assignment in optical networks from edge disjoint path algorithms , 2002, IEEE Communications Letters.
[17] Bo Peng,et al. An ejection chain approach for the quadratic multiple knapsack problem , 2016, Eur. J. Oper. Res..
[18] Fred W. Glover,et al. Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..
[19] Kumar N. Sivarajan,et al. Routing and wavelength assignment in all-optical networks , 1995, TNET.
[20] Kyungsik Lee,et al. An Optimization Approach to Routing and Wavelength Assignment in WDM All‐Optical Mesh Networks without Wavelength Conversion , 2002 .
[21] Nina Skorin-Kapov,et al. Routing and wavelength assignment in optical networks using bin packing based algorithms , 2007, Eur. J. Oper. Res..
[22] Rahul Simha,et al. The Partition Coloring Problem and its Application to Wavelength Routing and Assignment , 2000 .
[23] Imrich Chlamtac,et al. Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..