Minimax Models for Diverse Routing

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Aneja Y. P., Chandrasekaran R., Nair K. P. K. Classes of linear programs with integral optimal solutions. Mathematical Programming Study (1985) 24:225–237Crossref, Google Scholar
• Aneja Y. P., Nair K. P. K. Two problems in multicommodity networks. R.A.I.R.O. Recherche Operationnelle/Operations Research (1979) 13:135–142Google Scholar
• Aneja Y. P., Nair K. P. K. Maximal expected flow in a network subject to arc failures. Networks (1980) 10:45–57Crossref, Google Scholar
• Aneja Y. P., Nair K. P. K. Network flows with age dependent decay rates. European Journal of Operational Research (1985) 21:77–81Crossref, Google Scholar
• Brecht T. B., Colbourn C. J. Lower bounds on two-terminal network reliability. Discrete Applied Mathematics (1988) 21:185–198Crossref, Google Scholar
• Brumbaugh-Smith J. P. Diversified network routing via minimax objectives. (2000) . Ph.D. dissertation, Department of Mathematical Sciences, Clemson University, Clemson, SCGoogle Scholar
• Brumbaugh-Smith J. P., Shier D. R. Online Supplement to ‘Minimax models for diverse routing’. INFORMS Journal on Computing (2002) . Online Supplement toGoogle Scholar
• Cidon I., Rom R., Shavitt Y. Analysis of multi-path routing. IEEE Transactions on Networking (1999) 7:885–896Crossref, Google Scholar
• Ford L. R., Fulkerson D. R. A suggested computation for maximal multi-commodity network flows. Management Science (1958) 5:97–101Link, Google Scholar
• Glicksman A. M.An Introduction to Linear Programming and the Theory of Games (1962) (Wiley, New York) Google Scholar
• Itai A., Perl Y., Shiloach Y. The complexity of finding maximum disjoint paths with length constraints. Networks (1982) 12:277–286Crossref, Google Scholar
• Krishnan R., Silvester J. A. An approach to path-splitting in multipath networks. Proceedings of the ICC (1993) 1353–1357Google Scholar
• Leighton F. T.Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (1992) (Morgan Kaufman, San Mateo, CA) Google Scholar
• Li C.-L., McCormick S. T., Simchi-Levi D. The complexity of finding two disjoint paths with min-max objectives. Discrete Applied Mathematics (1990) 26:105–115Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar
• Peha J. M., Tobagi F. A. Analyzing the fault tolerance of double-loop networks. IEEE Transactions on Networking (1994) 2:363–373Crossref, Google Scholar
• Read R. C., Tarjan R. E. Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks (1975) 5:237–252Crossref, Google Scholar
• Scott K., Pabón-Jiménez G., Bernstein D. Finding alternatives to the best path. (1997) . Transportation Research Board, Preprint #970682. http://www.trb.orgGoogle Scholar
• Suurballe J. W. Disjoint paths in a network. Networks (1974) 4:125–145Crossref, Google Scholar
• Tarjan R. E.Data Structures and Network Flows (1983) (SIAM, Philadelphia, PA) Crossref, Google Scholar
• Topkis D. M. Akshortest path algorithm for adaptive routing in communications networks. IEEE Transactions on Communications (1988) 36:855–859Crossref, Google Scholar
• Torrieri D. Algorithms for finding an optimal set of short disjoint paths in a communication network. IEEE Transactions on Communications (1992) 40:1698–1702Crossref, Google Scholar