A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems

References

• Ball M. O. , Colbourn C. J. , Provan J. S. , Ball M. O. , Magnanti T. L. , Monma C. L. , Nemhauser G. L. Network Reliability. Network Models (1995) (North-Holland, Amsterdam) 673 762 . Handbook in Operations Research and Management Science Crossref, Google Scholar
• Berge C. Graphs and Hypergraphs (1973) (North-Holland, Amsterdam) Google Scholar
• Cplex Optimization, Inc. Using the CPLEX Callable Library and CPLEX Mixed Integer Library (1993) (Incline Village, NV) Google Scholar
• Dahl G. , Stoer M. MULTISUN—Mathematical Model and Algorithms. (1992) . Technical Report TF R 46/92, Norwegian Telecom Research, Kjeller, Norway Google Scholar
• Ford L. R. , Fulkerson D. R. A Suggested Computation for Maximal Multicommodity Network Flows. Management Science (1968) 5 97 101 Link, Google Scholar
• Gavish B. , Trudeau P. , Dror M. , Gendreau M. , Mason L. Fiberoptic Circuit Network Design under Reliability Constraints. IEEE Journal on Selected Areas in Communications (1989) 7 1181 1187 Crossref, Google Scholar
• Godø H. , Mathisen K. O. , Nordby K. , Nymo B. J. , Sæther J. P. Without Telephone: An Investigation among the Norwegian Telecom's Subscribers after the Fire in Frogner Exchange (in Norwegian). (1986) . Report 50/86, Norwegian Telecom Research, Kjeller, Norway Google Scholar
• Grotschel M. , Monma C. L. , Stoer M. , Ball M. O. , Magnanti T. L. , Monma C. L. , Nemhauser G. L. Design of Survivable Networks. Network Models. Handbook in Operations Research and Management Science (1995) (North-Holland, Amsterdam) 617 672 Google Scholar
• Iri M. On an Extension of the Maximum-Flow Minimum-Cut Theorem to Multicommodity Flows. Journal of the Operations Research Society of Japan (1971) 13 129 135 Google Scholar
• Lee K. , Park K. , Park S. Spare Channel Assignment for DCS Mesh-Restorable Networks. Proceedings of the 3rd International Conference on Telecommunication Systems (1995) Nashville 296 307 Google Scholar
• Leong T. , Shor P. , Stein C. , Johnson D. S. , McGeogh C. C. Implementation of a Combinatorial Multicommodity Flow Algorithm. DIMACS Implementation Challenge Workshop, Algorithms for Network Flow and Matching (1992) 202 224 . DIMACS Technical report 92-4 Google Scholar
• Lisser A. , Sarkissian R. , Vial J. P. Survivability in Telecommunication Networks. (1995) . Technical report NT/PAA/ATR/ORI/4230, France Telecom/CNET, Issy Les Moulineaux, France Google Scholar
• Lomonosov M. V. Combinatorial Approaches to Multiflow Problems. Discrete Applied Mathematics (1985) 11 1 93 Crossref, Google Scholar
• Martello S. , Toth P. The Multiple-Choice Knapsack Problem. Knapsack Problems: Algorithms and Computer Implementations (1990) (Wiley, Chichester) 77 80 Google Scholar
• Minoux M. , Hansen P. Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements. Studies on Graphs and Discrete Programming (1981) (North-Holland, Amsterdam) 269 277 Crossref, Google Scholar
• Onaga K. , Kakusho O. On Feasibility Conditions of Multicommodity Flows in Networks. Transactions on Circuit Theory (1971) CT-18 425 429 Crossref, Google Scholar
• Schrijver A. Theory of Linear and Integer Programming (1986) (Wiley, Chichester) Google Scholar
• Sen S. , Doverspike R. D. , Cosares S. Network Planning with Random Demand. Telecommunication Systems (1994) 3 11 30 Crossref, Google Scholar
• Stoer M. , Dahl G. A Polyhedral Approach to Multicommodity Network Design. Numerische Mathematik (1994) 68 149 167 Crossref, Google Scholar
• Wolsey L. A. Valid Inequalities for 0–1 Knapsacks and MIPs with Generalised Upper Bound Constraints. Discrete Applied Mathematics (1990) 29 251 261 Crossref, Google Scholar
• Zorpette G. Keeping the Phone Lines Open. IEEE Spectrum June 1989 (1989) 32 36 Google Scholar