Puzzle - The Fillomino Puzzle. - Robin H. Pearce; Michael A. Forbes 002 (INFORMS Trans. Educ., 2017)

Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem. - Robin H. Pearce; Michael A. Forbes 002 (Eur. J. Oper. Res., 2018)

Monte-Carlo Tree Search in Dragline Operation Planning. - Haoquan Liu; Kevin J. Austin; Michael A. Forbes 002; Michael Kearney (IEEE Robotics Autom. Lett., 2018)

Disaggregated benders decomposition for solving a network maintenance scheduling problem. - Robin H. Pearce; Michael A. Forbes 002 (J. Oper. Res. Soc., 2019)

An Exact Algorithm for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading. - Ali Mehsin Alyasiry; Michael A. Forbes 002; Michael Bulmer (Transp. Sci., 2019)

Optimal blending strategies for coking coal using chance constraints. - Rick Jeuken; Michael A. Forbes 002; Michael Kearney (J. Oper. Res. Soc., 2021)

A New Formulation for the Dial-a-Ride Problem. - Yannik Rist; Michael A. Forbes 002 (Transp. Sci., 2021)

A column generation and Combinatorial Benders Decomposition algorithm for the Selective Dial-A-Ride-Problem. - Yannik Rist; Michael A. Forbes 002 (Comput. Oper. Res., 2022)

The Snake Eggs Puzzle: Preparing Students for Benders Decomposition. - Mitchell G. Harris; Michael A. Forbes 002 (INFORMS Trans. Educ., 2023)

Logic-based benders decomposition for wildfire suppression. - Mitchell G. Harris; Michael A. Forbes 002; Thomas Taimre (Comput. Oper. Res., 2023)

Benders Decomposition with Delayed Disaggregation for the Active Passive Vehicle Routing Problem. - Yannik Rist; Christian Tilk; Michael A. Forbes 002 (Eur. J. Oper. Res., 2024)

Combining optimisation and simulation using logic-based Benders decomposition. - Michael A. Forbes 002; Mitchell G. Harris; H. M. Jansen; Femke A. Van Der Schoot; Thomas Taimre (Eur. J. Oper. Res., 2024)

Algorithms for pickup and delivery problems with hours of service constraints. - Lucas Sippel; Michael A. Forbes 002; Joseph Menesch (Comput. Oper. Res., 2025)