Deepest Cuts for Benders Decomposition

References

• Adulyasak Y, Cordeau JF, Jans R (2015) Benders decomposition for production routing under demand uncertainty. Oper. Res. 63(4):851–867.Link, Google Scholar
• Alshamsi A, Diabat A (2018) Large-scale reverse supply chain network design: An accelerated Benders decomposition algorithm. Comput. Indust. Engrg. 124:545–559.Crossref, Google Scholar
• Balas E, Ceria S, Cornuéjols G (1993) A lift-and-project cutting plane algorithm for mixed 0–1 programs. Math. Programming 58(1–3):295–324.Crossref, Google Scholar
• Bayram V, Yaman H (2017) Shelter location and evacuation route assignment under uncertainty: A Benders decomposition approach. Transportation Sci. 52(2):416–436.Link, Google Scholar
• Beasley J (2021) ORLIB. Accessed May 2021, http://people.brunel.ac.uk/mastjjb/jeb/orlib/capinfo.html.Google Scholar
• Belotti P, Kirches C, Leyffer S, Linderoth J, Luedtke J, Mahajan A (2013) Mixed-integer nonlinear optimization. Acta Numerica 22:1–131.Crossref, Google Scholar
• Ben-Ameur W, Neto J (2007) Acceleration of cutting-plane and column generation algorithms: Applications to network design. Networks 49(1):3–17.Crossref, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238–252.Crossref, Google Scholar
• Bodur M, Luedtke JR (2016) Mixed-integer rounding enhanced Benders decomposition for multiclass service-system staffing and scheduling with arrival rate uncertainty. Management Sci. 63(7):2073–2091.Link, Google Scholar
• Bodur M, Dash S, Günlük O, Luedtke J (2016) Strengthened Benders cuts for stochastic integer programs with continuous recourse. INFORMS J. Comput. 29(1):77–91.Link, Google Scholar
• Boland N, Fischetti M, Monaci M, Savelsbergh M (2016) Proximity Benders: A decomposition heuristic for stochastic programs. J. Heuristics 22(2):181–198.Crossref, Google Scholar
• Bonami P, Salvagnin D, Tramontani A (2020) Implementing automatic benders decomposition in a modern MIP solver. Bienstock D, Zambelli G, eds. Integer Programming and Combinatorial Optimization. IPCO 2020, Lecture Notes in Computer Science, vol. 12125 (Springer, Cham, Switzerland), 78–90.Google Scholar
• Bonami P, Biegler LT, Conn AR, Cornuéjols G, Grossmann IE, Laird CD, Lee J, et al. (2008) An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2):186–204.Crossref, Google Scholar
• Cadoux F (2010) Computing deep facet-defining disjunctive cuts for mixed-integer programming. Math. Programming 122(2):197–223.Crossref, Google Scholar
• Charnes A, Cooper WW (1962) Programming with linear fractional functionals. Naval Res. Logist. Quart. 9(3–4):181–186.Crossref, Google Scholar
• Cho SH, Jang H, Lee T, Turner J (2014) Simultaneous location of trauma centers and helicopters for emergency medical service planning. Oper. Res. 62(4):751–771.Link, Google Scholar
• Codato G, Fischetti M (2006) Combinatorial Benders’ cuts for mixed-integer linear programming. Oper. Res. 54(4):756–766.Link, Google Scholar
• Conforti M, Wolsey LA (2019) “Facet” separation with one linear program. Math. Programming 178(1):361–380.Crossref, Google Scholar
• Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming, vol. 271 (Springer, New York).Crossref, Google Scholar
• Contreras I, Cordeau JF, Laporte G (2011) Benders decomposition for large-scale uncapacitated hub location. Oper. Res. 59(6):1477–1490.Link, Google Scholar
• Contreras I, Cordeau JF, Laporte G (2012) Exact solution of large-scale hub location problems with multiple capacity levels. Transportation Sci. 46(4):439–459.Link, Google Scholar
• Cornuéjols G, Sridharan R, Thizy JM (1991) A comparison of heuristics and relaxations for the capacitated plant location problem. Eur. J. Oper. Res. 50(3):280–297.Crossref, Google Scholar
• Crainic TG, Frangioni A, Gendron B (2001) Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. 112(1–3):73–99.Crossref, Google Scholar
• Crainic TG, Hewitt M, Maggioni F, Rei W (2021) Partial Benders decomposition: General methodology and application to stochastic network design. Transportation Sci. 55(2):414–435.Link, Google Scholar
• de Sá EM, de Camargo RS, de Miranda G (2013) An improved Benders decomposition algorithm for the tree of hubs location problem. Eur. J. Oper. Res. 226(2):185–202.Crossref, Google Scholar
• Duran MA, Grossmann IE (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Programming 36(3):307–339.Crossref, Google Scholar
• Fischetti M, Salvagnin D (2010) An in-out approach to disjunctive optimization. Lodi A, Milano M, Toth P, eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2010, Lecture Notes in Computer Science, vol. 6140 (Springer, Berlin, Heidelberg), 136–140.Google Scholar
• Fischetti M, Ljubić I, Sinnl M (2016) Benders decomposition without separability: A computational study for capacitated facility location problems. Eur. J. Oper. Res. 253(3):557–569.Crossref, Google Scholar
• Fischetti M, Ljubić I, Sinnl M (2017) Redesigning Benders decomposition for large-scale facility location. Management Sci. 63(7):2146–2162.Link, Google Scholar
• Fischetti M, Salvagnin D, Zanette A (2010) A note on the selection of Benders cuts. Math. Programming 124(1–2):175–182.Crossref, Google Scholar
• Fletcher R, Leyffer S (1994) Solving mixed integer nonlinear programs by outer approximation. Math. Programming 66(1):327–349.Crossref, Google Scholar
• Fontaine P, Minner S (2018) Benders decomposition for the hazmat transport network design problem. Eur. J. Oper. Res. 267(3):996–1002.Crossref, Google Scholar
• Fontaine P, Minner S (2023) A branch-and-repair method for three-dimensional bin selection and packing in e-commerce. Oper. Res. 71(1):273–288.Link, Google Scholar
• Fortz B, Poss M (2009) An improved Benders decomposition applied to a multi-layer network design problem. Oper. Res. Lett. 37(5):359–364.Crossref, Google Scholar
• Geoffrion AM (1972) Generalized Benders decomposition. J. Optim. Theory Appl. 10(4):237–260.Crossref, Google Scholar
• Ghosh D (2003) Neighborhood search heuristics for the uncapacitated facility location problem. Eur. J. Oper. Res. 150(1):150–162.Crossref, Google Scholar
• Görtz S, Klose A (2012) A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem. INFORMS J. Comput. 24(4):597–610.Link, Google Scholar
• Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math. Programming 96(1):33–60.Crossref, Google Scholar
• Keyvanshokooh E, Ryan SM, Kabir E (2016) Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition. Eur. J. Oper. Res. 249(1):76–92.Crossref, Google Scholar
• Khassiba A, Bastin F, Cafieri S, Gendron B, Mongeau M (2020) Two-stage stochastic mixed-integer programming with chance constraints for extended aircraft arrival management. Transportation Sci. 54(4):897–919.Link, Google Scholar
• Kratica J, Tošic D, Filipović V, Ljubić I (2001) Solving the simple plant location problem by genetic algorithm. RAIRO Oper. Res. 35(1):127–142.Crossref, Google Scholar
• Magnanti TL, Wong RT (1981) Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. 29(3):464–484.Link, Google Scholar
• Maheo A, Kilby P, Van Hentenryck P (2017) Benders decomposition for the design of a hub and shuttle public transit system. Transportation Sci. 53(1):77–88.Link, Google Scholar
• Maher SJ (2021) Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework. Eur. J. Oper. Res. 290(2):479–498.Crossref, Google Scholar
• Mercier A (2008) A theoretical comparison of feasibility cuts for the integrated aircraft-routing and crew-pairing problem. Transportation Sci. 42(1):87–104.Link, Google Scholar
• Naderi B, Roshanaei V, Begen MA, Aleman DM, Urbach DR (2021) Increased surgical capacity without additional resources: Generalized operating room planning and scheduling. Production Oper. Management 30(8):2608–2635.Crossref, Google Scholar
• Pan F, Morton DP (2008) Minimizing a stochastic maximum-reliability path. Networks 52(3):111–119.Crossref, Google Scholar
• Papadakos N (2008) Practical enhancements to the Magnanti–Wong method. Oper. Res. Lett. 36(4):444–449.Crossref, Google Scholar
• Pearce RH, Forbes M (2018) Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem. Eur. J. Oper. Res. 270(1):78–88.Crossref, Google Scholar
• Perrykkad A, Ernst AT, Krishnamoorthy M (2022) A simultaneous Magnanti-Wong method to accelerate Benders decomposition for the metropolitan container transportation problem. Oper. Res. 70(3):1531–1559.Link, Google Scholar
• Rahimi A, Gönen M (2022) Efficient multitask multiple kernel learning with application to cancer research. IEEE Trans. Cybernetics 52(9):8716–8728.Crossref, Google Scholar
• Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The Benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259(3):801–817.Crossref, Google Scholar
• Saharidis GK, Ierapetritou MG (2010) Improving Benders decomposition using maximum feasible subsystem (MFS) cut generation strategy. Comput. Chemical Engrg. 34(8):1237–1245.Crossref, Google Scholar
• Santoso T, Ahmed S, Goetschalckx M, Shapiro A (2005) A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167(1):96–115.Crossref, Google Scholar
• Sherali HD, Lunday BJ (2013) On generating maximal nondominated Benders cuts. Ann. Oper. Res. 210(1):57–72.Crossref, Google Scholar
• Taherkhani G, Alumur SA, Hosseini M (2020) Benders decomposition for the profit maximizing capacitated hub location problem with multiple demand classes. Transportation Sci. 54(6):1446–1470.Link, Google Scholar
• Taherkhani G, Alumur SA, Hosseini M (2021) Robust stochastic models for profit-maximizing hub location problems. Transportation Sci. 55(6):1322–1350.Link, Google Scholar
• Tibshirani R (1996) Regression shrinkage and selection via the lasso. J. Roy. Statist. Soc. B 58(1):267–288.Crossref, Google Scholar