References
- Achterberg, T. (2007). Constraint integer programming ( PhD thesis). Technische Universität Berlin, Fakultät II - Mathematik und Naturwissenschaften.
- Benders, J. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238–252.
- Boland, N., Kalinowski, T., Waterer, H., & Zheng, L. (2014). Scheduling arc maintenance jobs in a network to maximize total flow over time. Discrete Applied Mathematics, 163, 34–52.
- Camargo, R., Miranda, G., Jr, & Luna, H. (2008). Benders decomposition for the uncapacitated multiple allocation hub location problem. Computers and Operations Research, 35, 1047–1064.
- Cordeau, J., Soumis, F., & Desrosiers, J. (2000). A Benders becomposition approach for the locomotive and car assignment problem. Transportation Science, 34(2), 133–149.
- Elias, P., Feinstein, A. & Shannon, C. (1956). A note on the maximum flow through a network. IRE Transactions on Information Theory, 2, 117–119.
- Fischetti, M., Ljubi, I., & Sinnl, M. (2017). Redesigning Benders decomposition for large-scale facility location. Management Science, 63(7), 2146–2162.
- Ford, L., Jr, & Fulkerson, D. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8, 399–404.
- Fortz, B., & Poss, M. (2009). An improved Benders decomposition applied to a multi-layer network design problem. Operations Research Letters, 37, 359–364.
- Gurobi Optimization, Inc (2015). Gurobi optimizer reference manual. www.gurobi.com
- Lawler, E. (1976). Combinatorial optimization: Networks and matroids. Holt: Rinehart and Winston.
- Lusby, R., Muller, L., & Petersen, B. (2013). A solution approach based on Benders decomposition for the preventive maintenance scheduling problem of a stochastic large-scale energy system. Journal of Scheduling, 16, 605–628.
- Magnanti, T. & Wong, R. (1981). Accelerating Benders decomposition: algorithmic enhancement and model selection criteria. Operations Research, 29(3), 464–484.
- Magnanti, T., & Wong, R. (1984). Network design and transportation planning: Models and algorithms. Transportation Science, 18(1), 1–55.
- McDaniel, D., & Devine, M. (1977). A Modified Benders’ Partitioning Algorithm for Mixed Integer Programming. Management Science, 24(3), 312–319.
- Nurre, S., Cavdaroglu, B., Mitchell, J., Sharkey, T., & Wallace, W. (2012). Restoring infrastructure sytems: An integrated network design and scheduling (INDS) problem. European Journal of Operational Research, 223, 794–806.
- Papadakos, N. (2008). Practical enhancements to the Magnanti-Wong method. Operations Research Letters, 36, 444–449.
- Sá, E., Camargo, R., & Miranda, G. (2013). An improved Benders decomposition algorithm for the tree of hubs location problem. European Journal of Operational Research, 226, 185–202.
- Tang, L., Jiang, W., & Saharidis, G. (2013). An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions. Annals of Operations Research, 210, 165–190.