Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations

References

• Andreas A. K. Mathematical programming algorithms for robust routing and evacuation problems. (2006) . Ph.D. thesis, Department of Systems and Industrial Engineering, University of Arizona, TucsonGoogle Scholar
• Andreas A. K., Smith J. C., Küçükyavuz S. Branch-and-price-and-cut algorithms for solving the reliable h-paths problem. J. Global Optim. (2008) . ForthcomingCrossref, Google Scholar
• Beasley J. E., Christofides N. An algorithm for the resource constrained shortest path problem. Networks (1989) 19(4Crossref, Google Scholar
• Falk J. E., Soland R. M. An algorithm for separable nonconvex programming problems. Management Sci. (1969) 15(9):550–569Link, Google Scholar
• Fortune S., Hopcroft J., Wyllie J. The directed subgraph homeomorphism problem. Theoret. Comput. Sci. (1980) 10:111–121Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, San Francisco) Google Scholar
• Handler G. Y., Zang I. A dual algorithm for the constrained shortest path problem. Networks (1980) 10(4):293–310Crossref, Google Scholar
• Hassin R. Approximation schemes for the restricted shortest path problem. Math. Oper. Res. (1992) 17(1):36–42Link, Google Scholar
• Joksch H. C. The shortest route problem with constraints. J. Math. Anal. Appl. (1966) 14:191–197Crossref, Google Scholar
• Li G., Wang D., Kalmanek C., Doverspike R. Efficient distributed path selection for shared restoration connections. IEEE INFOCOM 2002 (2002) 1:140–149Google Scholar
• Liu Y., Tipper D. Successive survivable routing for node failures. GLOBECOM 2001—IEEE Global Telecomm. Conf. (2001) 4(Institute of Electrical and Electronics Engineers, Washington, D.C.) 2093–2097Google Scholar
• Mehlhorn K., Ziegelmann M. Resource constrained shortest paths. Proc. 8th Annual Eur. Sympos. Algorithms (ESA 2000), Lecture Notes in Computer Science (2000) 1879(Springer-Verlag, London) 326–337Crossref, Google Scholar
• Pan F., Charlton W. S., Morton D. P., Woodruff D. L. A stochastic program for interdicting smuggled nuclear material. Network Interdiction and Stochastic Integer Programming (2003) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 1–20Crossref, Google Scholar
• Sherali H. D., Adams W. P.A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Programs (1999) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• Sherali H. D., Tuncbilek C. H. A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Global Optim. (1992) 2(1):101–112Crossref, Google Scholar
• Suurballe J. W. Disjoint paths in a network. Networks (1974) 4:125–145Crossref, Google Scholar
• Xu D., Qiao C., Xiong Y. An ultra-fast shared path protection scheme—Distributed partial information management. Part II. Proc. 10th IEEE Internat. Conf. Network Protocols (2002) (Institute of Electrical and Electronics Engineers, Washington, D.C.) 344–353Google Scholar
• Yee J. R., Lin F. Y. S. A routing algorithm for virtual circuit data networks with multiple sessions per O-D pair. Networks (1992) 22:185–208Crossref, Google Scholar