- Achterberg T (2007) Constraint integer programming. PhD thesis, Technische Universität Berlin.
Paper not yet in RePEc: Add citation now
Adulyasak Y, Cordeau JF, Jans R (2015) Benders decomposition for production routing under demand uncertainty. Oper Res 63(4):851–867.
Angulo G, Ahmed S, Dey SS (2016) Improving the integer l-shaped method. INFORMS J Comput 28(3):483–499.
- Balas E (1979) Disjunctive programming. Ann Discrete Math 5:3–51.
Paper not yet in RePEc: Add citation now
- Balas E, Ceria S, Cornuéjols G (1993) A lift-and-project cutting plane algorithm for mixed 0–1 programs. Math Progr 58(1):295–324.
Paper not yet in RePEc: Add citation now
- Balas E, Ceria S, Cornuéjols G (1996) Mixed 0–1 programming by lift-and-project in a branch-and-cut framework. Manag Sci 42(9):1229–1246.
Paper not yet in RePEc: Add citation now
- Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4(1):238–252.
Paper not yet in RePEc: Add citation now
Bihlmaier R, Koberstein A, Obst R (2009) Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty. OR Spectr 31(2):311.
- Birge JR, Louveaux F (2011) Introduction to stochastic programming, 2nd edn. Springer, Berlin.
Paper not yet in RePEc: Add citation now
Birge JR, Louveaux FV (1988) A multicut algorithm for two-stage stochastic linear programs. Eur J Oper Res 34(3):384–392.
Bodur M, Dash S, Günlük O, Luedtke J (2017) Strengthened benders cuts for stochastic integer programs with continuous recourse. INFORMS J Comput 29(1):77–91.
- Bodur M, Luedtke JR (2016) Mixed-integer rounding enhanced benders decomposition for multiclass service-system staffing and scheduling with arrival rate uncertainty. Manag Sci 63(7):2073–2091.
Paper not yet in RePEc: Add citation now
- Carøe CC, Schultz R (1999) Dual decomposition in stochastic integer programming. Oper Res Lett 24(1):37–45.
Paper not yet in RePEc: Add citation now
Carøe CC, Tind J (1997) A cutting-plane approach to mixed 0–1 stochastic integer programs. Eur J Oper Res 101(2):306–316.
Cordeau JF, Pasin F, Solomon MM (2006) An integrated model for logistics network design. Ann Oper Res 144(1):59–82.
- Costa AM (2005) A survey on benders decomposition applied to fixed-charge network design problems. Comput Oper Res 32(6):1429–1450.
Paper not yet in RePEc: Add citation now
- Costa AM, Cordeau JF, Gendron B, Laporte G (2012) Accelerating benders decomposition with heuristicmaster problem solutions. Pesquisa Operacional 32(1):03–20.
Paper not yet in RePEc: Add citation now
- Crainic TG, Hewitt M, Maggioni F, Rei W (2016) Partial Benders decomposition strategies for two-stage stochastic integer programs. Université du Québec à Montréal, Iteruniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT).
Paper not yet in RePEc: Add citation now
- Fischetti M, Lodi A, Tramontani A (2011) On the separation of disjunctive cuts. Math Prog 128(1):205–230.
Paper not yet in RePEc: Add citation now
- Gade D, Küçükyavuz S, Sen S (2014) Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs. Math Prog 144(1):39–64.
Paper not yet in RePEc: Add citation now
Gendron B, Scutellà MG, Garroppo RG, Nencioni G, Tavanti L (2016) A branch-and-benders-cut method for nonlinear power design in green wireless local area networks. Eur J Oper Res 255(1):151–162.
- Kılınç MR, Linderoth J, Luedtke J (2017) Lift-and-project cuts for convex mixed integer nonlinear programs. Math Programm Comput 9(4):499–526. https://doi.org/10.1007/s12532-017-0118-1 .
Paper not yet in RePEc: Add citation now
McDaniel D, Devine M (1977) A modified benders’ partitioning algorithm for mixed integer programming. Manag Sci 24(3):312–319.
- Ntaimo L (2004) Decomposition algorithms for stochastic combinatorial optimization: Computational experiments and extensions. PhD thesis, The University of Arizona.
Paper not yet in RePEc: Add citation now
Ntaimo L (2013) Fenchel decomposition for stochastic mixed-integer programming. J Global Optim 55(1):141–163.
- Powell WB, Topaloglu H (2003) Stochastic programming in transportation and logistics. Handbooks in operations research and management science stochastic programming. Elsevier, Amsterdam, pp 555–635.
Paper not yet in RePEc: Add citation now
- Qi Y, Sen S (2017) The Ancestral Benders’ cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming. Math Programm Ser A and B 161(1-2).
Paper not yet in RePEc: Add citation now
Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The benders decomposition algorithm: a literature review. Eur J Oper Res 259(3):801–817.
- Saharidis GK, Boile M, Theofanis S (2011) Initialization of the benders master problem using valid inequalities applied to fixed-charge network problems. Expert Syst Appl 38(6):6627–6636.
Paper not yet in RePEc: Add citation now
- Sen S, Higle JL (2005) The c3 theorem and a d2 algorithm for large scale stochastic mixed-integer programming: Set convexification. Math Program 104(1):1–20.
Paper not yet in RePEc: Add citation now
- Sen S, Sherali HD (2006) Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Math Program 106(2):203–223.
Paper not yet in RePEc: Add citation now
Tang L, Jiang W, Saharidis GKD (2013) An improved benders decomposition algorithm for the logistics facility location problem with capacity expansions. Ann Oper Res 210(1):165–190.
- Vadlamani S, Schweitzer D, Medal H, Nandi A, Eksioglu B (2018) A mixed-integer programming approach for locating jamming devices in a flow-jamming attack. Comput Oper Res 95:83–96.
Paper not yet in RePEc: Add citation now
- Van Slyke R, Wets R (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J Appl Math 17(4):638–663.
Paper not yet in RePEc: Add citation now
Weskamp C, Koberstein A, Schwartz F, Suhl L, Voß S (2019) A two-stage stochastic programming approach for identifying optimal postponement strategies in supply chains with uncertain demand. Omega 83:123–138.
- Wesselman F (2010) Generating general-purpose cutting planes for mixed-integer programs. phdthesis, Universität Padeborn.
Paper not yet in RePEc: Add citation now
Wolf C, Fábián CI, Koberstein A, Suhl L (2014) Applying oracles of on-demand accuracy in two-stage stochastic programming: a computational study. Eur J Oper Res 239:437–448.
Wolf C, Koberstein A (2013) Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested l-shaped method. Eur J Oper Res 230(1):143–156.
- Zarandi MMF (2010) Using decomposition to solve facility location/fleet management problems. PhD thesis, University of Toronto.
Paper not yet in RePEc: Add citation now
- Zhang M, Küçükyavuz S (2014) Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs. SIAM J Optim 24(4):1933–1951.
Paper not yet in RePEc: Add citation now