Application of ILP-based Heuristic and Dantzig-Wolfe Decomposition to Solve the Multi-period Survivable Network Augmentation Problem

[1]  Heungsoon Felix Lee,et al.  Heuristic algorithms for the fiber optic network expansion problem , 1997, Telecommun. Syst..

[2]  Kemal Altinkemer,et al.  Topological design of wide area communication networks , 1992, Ann. Oper. Res..

[3]  Bernard Yaged,et al.  Minimum cost routing for static network models , 1971, Networks.

[4]  Dominic A. Schupke,et al.  Multiperiod planning for optical networks , 2010, 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS).

[5]  Bezalel Gavish,et al.  Telecommunications network topological design and capacity expansion: Formulations and algorithms , 1993, Telecommun. Syst..

[6]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[7]  Dominic A. Schupke,et al.  Multiperiod planning of optical protection schemes , 2011, 2011 IEEE GLOBECOM Workshops (GC Wkshps).

[8]  Bruno-Laurent Garcia,et al.  Iterative improvement methods for a multiperiod network design problem , 1998, Eur. J. Oper. Res..

[9]  Der-San Chen,et al.  Applied Integer Programming: Modeling and Solution , 2010 .

[10]  Eric R. Zieyel.  Operations research : applications and algorithms , 1988 .

[11]  Wayne D. Grover,et al.  Influence of modularity and economy-of-scale effects on design of mesh-restorable DWDM networks , 2000, IEEE Journal on Selected Areas in Communications.

[12]  Michel Gendreau,et al.  Multi-period capacity expansion for a local access telecommunications network , 2006, Eur. J. Oper. Res..

[13]  Parviz Kermani,et al.  MENTOR: an algorithm for mesh network topological optimization and routing , 1991, IEEE Trans. Commun..

[14]  Brody Todd.  The Use of Demand-wise Shared Protection in Creating Topology Optimized High Availability Networks , 2009 .

[15]  Michel Gendreau,et al.  Heuristics for multi-period capacity expansion in local telecommunications networks , 2009, J. Heuristics.

[16]  Chi Guan,et al.  Long-term capacity planning of WDM transport networks under demand uncertainties and economy of scale , 2006, 2006 11th International Workshop on Computer-Aided Modeling, Analysis and Design of Communication Links and Networks.

[17]  Arie M. C. A. Koster,et al.  A dynamic programming algorithm for the local access telecommunication network expansion problem , 2000, Eur. J. Oper. Res..

[18]  Massimo Tornatore,et al.  Variable aggregation in the ILP design of WDM networks with dedicated protection , 2007, Journal of Communications and Networks.

[19]  François Vanderbeck,et al.  On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm , 2000, Oper. Res..

[20]  Moshe Sidi,et al.  Topological design of local-area networks using genetic algorithms , 1996, TNET.

[21]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[22]  Wayne D. Grover,et al.  The Forcer Concept and Express Route Planning in Mesh-Survivable Networks , 2004, Journal of Network and Systems Management.

[23]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[24]  Wayne D. Grover,et al.  Two strategies for spare capacity placement in mesh restorable networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[25]  Fabio D'Andreagiovanni,et al.  A fast hybrid primal heuristic for multiband robust capacitated network design with multiple time periods , 2014, Appl. Soft Comput..

[26]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[27]  Michel Gendreau,et al.  Metaheuristics in Combinatorial Optimization , 2022 .

[28]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[29]  J. Desrosiers,et al.  BRANCH-PRICE-AND-CUT ALGORITHMS , 2011 .

[30]  Piet Demeester,et al.  Long-Term Planning of WDM Networks: A Comparison between Single-Period and Multi-Period Techniques , 2004, Photonic Network Communication.

[31]  Thomas R. Stidsen,et al.  Heuristic methods for shared backup path protection planning , 2012, 2012 IV International Congress on Ultra Modern Telecommunications and Control Systems.

[32]  M. Herzberg,et al.  An optimal spare-capacity assignment model for survivable networks with hop limits , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[33]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[34]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[35]  Mark W. Lewis,et al.  The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis , 2001, INFORMS J. Comput..

[36]  John Doucette,et al.  Survivable Network Capacity Allocation and Topology Design Using Multi-period Network Augmentation , 2015, Journal of Network and Systems Management.

[37]  John Doucette,et al.  Fast Efficient Design of Shared Backup Path Protected Networks Using a Multi-Flow Optimization Model , 2011, IEEE Transactions on Reliability.

[38]  M. Herzberg,et al.  The hop-limit approach for spare-capacity assignment in survivable networks , 1995, TNET.

[39]  Dominic A. Schupke,et al.  Multiperiod Planning with Controlled Shortest Path Routing , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[40]  Robert D. Doverspike,et al.  Efficient distributed path selection for shared restoration connections , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[41]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[42]  Martin W. P. Savelsbergh,et al.  A generic view of Dantzig-Wolfe decomposition in mixed integer programming , 2006, Oper. Res. Lett..

[43]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[44]  Chunming Qiao,et al.  An ultra-fast shared path protection scheme - distributed partial information management, part II , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..