Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows (1993) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Appleget J., Wood K., Laguna M., González-Velarde J. L. Explicit-constraint branching for solving mixed integer programs. Computing Tools for Modeling, Optimization and Simulation (2000) (Kluwer Academic Publishers, Boston, MA) 245–262Crossref, Google Scholar
• Balcioglu A., Wood R. K., Woodruff D. L. Enumerating near-min s-t cuts. Network Interdiction and Stochastic Integer Programming (2003) (Kluwer Academic Publishers, Boston) 21–49Crossref, Google Scholar
• Bingol L. A Lagrangian heuristic for solving a network interdiction problem. (2001) . Master’s thesis, Operations Research Department, Naval Postgraduate School, Monterey, CAGoogle Scholar
• Bracken J., McGill J. T. Defense applications of mathematical programs with optimization problems in the constraints. Oper. Res. (1974) 22:1086–1096Link, Google Scholar
• Bracken J., Falk J. E., Miercort F. A. A strategic weapons exchange allocation model. Oper. Res. (1977) 25:968–976Link, Google Scholar
• Carlyle W. M., Wood R. K. Near-shortest and k-shortest simple paths. Networks (2005) 46:98–109Crossref, Google Scholar
• Carlyle W. M., Fowler J. W., Gel E. S., Kim B. Quantitative comparison of approximate solution sets for bi-criteria optimization problems. Decision Sci. (2003) 34:63–82Crossref, Google Scholar
• Climaco J., Ferreira C., Captivo M., Climaco J. Multicriteria integer programming: An overview of the different algorithmic approaches. Multicriteria Analysis (1997) (Springer, Berlin, Germany) 248–258Crossref, Google Scholar
• Cormican K. J. Computational methods for deterministic and stochastic network interdiction problems. (1995) . Master’s thesis, Operations Research Department, Naval Postgraduate School, Monterey, CAGoogle Scholar
• Cormican K. J., Morton D. P., Wood R. K. Stochastic network interdiction. Oper. Res. (1998) 46:184–197Link, Google Scholar
• Derbes H. D. Efficiently interdicting a time-expanded transshipment network. (1997) . Master’s thesis, Operations Research Department, Naval Postgraduate School, Monterey, CAGoogle Scholar
• Edmonds J., Karp R. M. Theoretical improvements in algorithm efficiency for network flow problems. J. ACM (1972) 19:248–264Crossref, Google Scholar
• Ford L. R., Fulkerson D. R. Maximal flow through a network. Canadian J. Math. (1956) 8:399–404Crossref, Google Scholar
• Ford L. R., Fulkerson D. R. A simple algorithm for finding maximal network flows and an application to the Hitchcock problem. Canadian J. Math. (1957) 9:210–218Crossref, Google Scholar
• Harris T. E., Ross F. S. Fundamentals of a method for evaluating rail net capacities. (1955) . Research Memorandum RM-1573, The Rand Corp., Santa Monica, CAGoogle Scholar
• ILOGILOG CPLEX 9.1, User’s Manual (2005) . ILOG, S.A., Gentilly Cedex, FranceGoogle Scholar
• ILOGILOG Concert Technology (2006) . ILOG, S.A., Gentilly Cedex, France, http://www.ilog.com/products/optimization/tech/concert.cfmGoogle Scholar
• Lawler E. L.Combinatorial Optimization, Networks and Matroids (1976) (Holt, Rinehart and Winston, New York) Google Scholar
• Matlin S. A review of the literature on the missile allocation problem. Oper. Res. (1970) 17:334–373Link, Google Scholar
• Megiddo N. Combinatorial optimization with rational objective functions. Math. Oper. Res. (1979) 4:414–424Link, Google Scholar
• Salmeron J., Wood K., Baldick R. Analysis of electric grid security under terrorist threat. IEEE Trans. Power Systems (2004) 19-2:905–912Crossref, Google Scholar
• Shier D. R., Whited D. E. Iterative algorithms for generating minimal cutsets in directed graphs. Networks (1986) 16:133–147Crossref, Google Scholar
• Steinrauf R. L. Network interdiction models. (1991) . Master’s thesis, Operations Research Department, Naval Postgraduate School, Monterey, CAGoogle Scholar
• Sun MicrosystemsJava 1.4.2. Documentation (2004) . Sun Microsystems, Santa Clara, CA, http://www.java.sun.comGoogle Scholar
• Uygun A. Network interdiction by Lagrangian relaxation and branch-and-bound. (2002) . Master’s thesis, Operations Research Department, Naval Postgraduate School, Monterey, CAGoogle Scholar
• Wen U., Hsu S. Linear bi-level programming problems—A review. J. Oper. Res. Soc. (1991) 42:125–133Google Scholar
• Whiteman P. S. Improving single strike effectiveness for network interdiction. Military Oper. Res. (1999) 4:15–30Crossref, Google Scholar
• Wood R. K. Deterministic network interdiction. Math. Comput. Model. (1993) 17:1–18Crossref, Google Scholar