References

Bibliography for Presentation

Works Cited

Tutorials, Textbooks, and Reviews:

Papadimitriou, Christos H., and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Courier Corporation, 1998.

Torres, Juan J., et al. ‘A Review on the Performance of Linear and Mixed Integer Two-Stage Stochastic Programming Software’. Algorithms, vol. 15, no. 4, Mar. 2022, p. 103, https://doi.org/10.3390/a15040103.

Smith, J. Cole, and Yongjia Song. ‘A Survey of Network Interdiction Models and Algorithms’. European Journal of Operational Research, vol. 283, no. 3, June 2020, pp. 797–811, https://doi.org/10.1016/j.ejor.2019.06.024.

Rahmaniani, Ragheb, Teodor Gabriel Crainic, et al. ‘The Benders Decomposition Algorithm: A Literature Review’. European Journal of Operational Research, vol. 259, no. 3, June 2017, pp. 801–817, https://doi.org/10.1016/j.ejor.2016.12.005.

Pardalos, Panos M., et al., editors. Handbook of Combinatorial Optimization. Springer New York, 2013, https://doi.org/10.1007/978-1-4419-7997-1.

Shapiro, Alexander, and Andy Philpott. A Tutorial on Stochastic Programming.

Ntaimo, Lewis. ‘Stochastic Mixed-Integer Programming Methods’. Computational Stochastic Programming, vol. 774, Springer International Publishing, 2024, pp. 387–461, https://doi.org/10.1007/978-3-031-52464-6_9.

Problems Solved with Benders Decomposition:

Belieres, Simon, et al. ‘A Benders Decomposition-Based Approach for Logistics Service Network Design’. European Journal of Operational Research, vol. 286, no. 2, Oct. 2020, pp. 523–537, https://doi.org/10.1016/j.ejor.2020.03.056.

Brandenberg, René, and Paul Stursberg. ‘Refined Cut Selection for Benders Decomposition: Applied to Network Capacity Expansion Problems’. Mathematical Methods of Operations Research, vol. 94, no. 3, Dec. 2021, pp. 383–412, https://doi.org/10.1007/s00186-021-00756-8.

Wang, Ting, et al. An Improved Branch-and-Benders-Cut Algorithm for Two-Stage Scenario-Based Robust Winner Determination Problem. SSRN, 2025, https://doi.org/10.2139/ssrn.5144742.

Li, Shengdong, et al. ‘Freight Train Line Planning for Large-Scale High-Speed Rail Network: An Integer Benders Decomposition-Based Branch-and-Cut Algorithm’. Transportation Research Part E: Logistics and Transportation Review, vol. 192, Dec. 2024, p. 103750, https://doi.org/10.1016/j.tre.2024.103750.

Huang, Shengjun, and Venkata Dinavahi. ‘A Branch-and-Cut Benders Decomposition Algorithm for Transmission Expansion Planning’. IEEE Systems Journal, vol. 13, no. 1, Mar. 2019, pp. 659–669, https://doi.org/10.1109/JSYST.2017.2775610.

Erdős, P., and A. Rényi. ‘On Random Graphs I’. Publ. Math. Debrecen, vol. 6, no. 290–297, 1959, p. 18.

Geoffrion, Arthur M., and Glenn W. Graves. ‘Multicommodity Distribution System Design by Benders Decomposition’. Management Science, vol. 20, no. 5, INFORMS, 1974, pp. 822–844.

Towle, Eli, and James Luedtke. ‘New Solution Approaches for the Maximum-Reliability Stochastic Network Interdiction Problem’. Computational Management Science, vol. 15, no. 3–4, Oct. 2018, pp. 455–477, https://doi.org/10.1007/s10287-018-0321-1.

Improvments to Benders Decomposition:

Fischetti, Matteo, et al. ‘A Note on the Selection of Benders’ Cuts’. Mathematical Programming, vol. 124, no. 1–2, July 2010, pp. 175–182, https://doi.org/10.1007/s10107-010-0365-7.

Bodur, Merve, et al. ‘Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse’. INFORMS Journal on Computing, vol. 29, no. 1, Jan. 2017, pp. 77–91, https://doi.org/10.1287/ijoc.2016.0717.

Magnanti, T. L., and R. T. Wong. ‘Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria’. Operations Research, vol. 29, no. 3, June 1981, pp. 464–484, https://doi.org/10.1287/opre.29.3.464.

Papadakos, Nikolaos. ‘Practical Enhancements to the Magnanti–Wong Method’. Operations Research Letters, vol. 36, no. 4, July 2008, pp. 444–449, https://doi.org/10.1016/j.orl.2008.01.005.

Network Interdiction:

Jr, L. R. Ford, and D. R. Fulkerson. ‘Maximal Flow Through a Network’. Canadian Journal of Mathematics, vol. 8, Jan. 1956, pp. 399–404, https://doi.org/10.4153/CJM-1956-045-5.

Israeli, Eitan, and R. Kevin Wood. ‘Shortest-Path Network Interdiction’. Networks, vol. 40, no. 2, 2002, pp. 97–111, https://doi.org/10.1002/net.10039.

Chauhan, Darshan, et al. ‘Robust Maximum Flow Network Interdiction Considering Uncertainties in Arc Capacity and Resource Consumption’. Annals of Operations Research, vol. 335, no. 2, Apr. 2024, pp. 689–725, https://doi.org/10.1007/s10479-023-05812-6.

Paul, Alice, and Susan E. Martonosi. ‘The All-Pairs Vitality-Maximization (VIMAX) Problem’. Annals of Operations Research, vol. 338, no. 2–3, July 2024, pp. 1019–1048, https://doi.org/10.1007/s10479-024-06022-4.

Martonosi, Susan E., et al. A New Framework for Network Disruption. arXiv, Sept. 2011, http://arxiv.org/abs/1109.2954.

O’Hanley, Jesse Rush, et al. ‘Locating and Protecting Critical Reserve Sites to Minimize Expected and Worst-Case Losses’. Biological Conservation, vol. 134, no. 1, Jan. 2007, pp. 130–141, https://doi.org/10.1016/j.biocon.2006.08.009.

Church, Richard L., et al. ‘Identifying Critical Infrastructure: The Median and Covering Facility Interdiction Problems’. Annals of the Association of American Geographers, vol. 94, no. 3, Sept. 2004, pp. 491–502, https://doi.org/10.1111/j.1467-8306.2004.00410.x.

Wollmer, Richard. ‘Removing Arcs from a Network’. Operations Research, vol. 12, no. 6, INFORMS, 1964, pp. 934–940.

Paul, Alice. Detecting Covert Members of Terrorist Networks.

Misc:

Jiang, Xin, et al. ‘Identifying Migration Routes of Wild Asian Elephants in China Based on Ecological Networks Constructed by Circuit Theory Model’. Animals, vol. 13, no. 16, Aug. 2023, p. 2618, https://doi.org/10.3390/ani13162618.

Crucitti, Paolo, et al. ‘Error and Attack Tolerance of Complex Networks’. Physica A: Statistical Mechanics and Its Applications, vol. 340, no. 1–3, Sept. 2004, pp. 388–394, https://doi.org/10.1016/j.physa.2004.04.031.

Corley, H. W., and Han Chang. ‘Finding the Most Vital Nodes in a Flow Network’. Management Science, vol. 21, no. 3, Nov. 1974, pp. 362–364, https://doi.org/10.1287/mnsc.21.3.362.