Network Synthesis with Non-Simultaneous Multicommodity Flow Requirements: Bounds and Heuristics
暂无分享,去创建一个
Martine Labbé | Patrick Soriano | René Séguin | Christelle Wynants | M. Labbé | P. Soriano | R. Séguin | Christelle Wynants
[1] Bernard Fortz,et al. Design of Survivable Networks with Bounded Rings , 2000, Network Theory and Applications.
[2] C. M. Shetty,et al. Nonlinear Programming - Theory and Algorithms, Second Edition , 1993 .
[3] T. Magnanti,et al. Polyhedral properties of the network restoration problem-with the convex hull of a special case , 1997 .
[4] Hideki Sakauchi,et al. A self-healing network with an economical spare-channel assignment , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.
[5] M. Gendreau,et al. Fondements et applications des méthodes de recherche avec tabous , 1994 .
[6] G. Ding. Discrete optimization , 1977 .
[7] Teodor Gabriel Crainic,et al. Multicommodity Capacitated Network Design , 1999 .
[8] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[9] Geir Dahl,et al. A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems , 1998, INFORMS J. Comput..
[10] Michel Minoux,et al. Network Synthesis and Dynamic Network Optimization , 1987 .
[11] Ronald L. Rardin,et al. Surrogate Dual Multiplier Search Procedures in Integer Programming , 1984, Oper. Res..
[12] Martin Dyer. Calculating surrogate constraints , 1980, Math. Program..
[13] Wayne D. Grover,et al. Optimal capacity placement for path restoration in mesh survivable networks , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.
[14] Krishnaiyan Thulasiraman,et al. A SIMPLEX SOLUTION TO THE MINIMUM COST NONSIMULTANEOUS MULTI-COMMODITY FLOW PROBLEM. , 1994 .
[15] Christelle Wynants. Network Synthesis Problems , 2000 .
[16] Jarosław Sikorski. Quasi — Subgradient algorithms for calculating surrogate constraints , 1986 .
[17] Abdel Lisser,et al. Optimal Joint Synthesis of Base and Reserve Telecommunication Networks , 1995 .
[18] M. Minoux. Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements* , 1981 .
[19] Ravindra K. Ahuja,et al. Applications of network optimization , 1992 .
[20] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[21] Bezalel Gavish,et al. Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..
[22] M. Venkataramanan,et al. A surrogate and Lagrangian approach to constrained network problems , 1989 .
[23] Thomas L. Magnanti,et al. Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..
[24] Ronald L. Rardin,et al. Technical Note - Searchability of the Composite and Multiple Surrogate Dual Functions , 1980, Oper. Res..
[25] Fred Glover,et al. Surrogate Constraint Duality in Mathematical Programming , 1975, Oper. Res..
[26] M. Herzberg,et al. A decomposition approach to assign spare channels in self-healing networks , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.
[27] T. C. Hu,et al. Synthesis of a Communication Network , 1964 .
[28] Moshe Dror,et al. Fiberoptic circuit network design under reliability constraints , 1989, IEEE J. Sel. Areas Commun..
[29] Fred W. Glover,et al. A user's guide to tabu search , 1993, Ann. Oper. Res..
[30] Wayne D. Grover,et al. Near optimal spare capacity planning in a mesh restorable network , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.