The application of recoverable robustness to airline planning problems. - Stephen J. Maher (2013)

Recoverable robust single day aircraft maintenance routing problem. - Stephen J. Maher; Guy Desaulniers; François Soumis (Comput. Oper. Res., 2014)

The Recoverable Robust Tail Assignment Problem. - Gary Froyland; Stephen J. Maher; Cheng-Lung Wu (Transp. Sci., 2014)

A novel passenger recovery approach for the integrated airline recovery problem. - Stephen J. Maher (Comput. Oper. Res., 2015)

PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite. - Stephen J. Maher; Matthias Miltenberger; João Pedro Pedroso; Daniel Rehfeldt; Robert Schwarz; Felipe Serrano 001 (ICMS, 2016)

The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences. - Stephen J. Maher; John M. Murray (Eur. J. Oper. Res., 2016)

Solving the Integrated Airline Recovery Problem Using Column-and-Row Generation. - Stephen J. Maher (Transp. Sci., 2016)

Distributed Domain Propagation. - Robert Lion Gottwald; Stephen J. Maher; Yuji Shinano (SEA, 2017)

Exact Methods for Recursive Circle Packing. - Ambros M. Gleixner; Stephen J. Maher; Benjamin Müller 002; João Pedro Pedroso (CoRR, 2017)

SCIP-Jack - a solver for STP and variants with parallelization extensions. - Gerald Gamrath; Thorsten Koch; Stephen J. Maher; Daniel Rehfeldt; Yuji Shinano (Math. Program. Comput., 2017)

The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints. - Stephen J. Maher; Guy Desaulniers; François Soumis (Eur. J. Oper. Res., 2018)

Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem. - Daniel Rehfeldt; Thorsten Koch; Stephen J. Maher (Networks, 2019)

Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition. - Ambros M. Gleixner; Stephen J. Maher; Benjamin Müller 002; João Pedro Pedroso (Ann. Oper. Res., 2020)

Generating hard instances for robust combinatorial optimization. - Marc Goerigk; Stephen J. Maher (Eur. J. Oper. Res., 2020)

Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms. - Stephen J. Maher; Ted K. Ralphs; Yuji Shinano (CoRR, 2021)

Avoiding redundant columns by adding classical Benders cuts to column generation subproblems. - Marco E. Lübbecke; Stephen J. Maher; Jonas T. Witt (Discret. Optim., 2021)

Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework. - Stephen J. Maher (Eur. J. Oper. Res., 2021)

Enhancing large neighbourhood search heuristics for Benders' decomposition. - Stephen J. Maher (J. Heuristics, 2021)

A data-driven, variable-speed model for the train timetable rescheduling problem. - Edwin Reynolds; Stephen J. Maher (Comput. Oper. Res., 2022)

Location, transshipment and routing: An adaptive transportation network integrating long-haul and local vehicle routing. - Junko Hosoda; Stephen J. Maher; Yuji Shinano; Jonas Christoffer Villumsen (EURO J. Transp. Logist., 2022)

Subproblem Separation in Logic-Based Benders' Decomposition for the Vehicle Routing Problem with Local Congestion. - Aigerim Saken; Stephen J. Maher (ATMOS, 2023)

Enabling Research through the SCIP Optimization Suite 8.0. - Ksenia Bestuzheva; Mathieu Besançon; Weikun Chen; Antonia Chmiela; Tim Donkiewicz; Jasper van Doornmalen; Leon Eifler; Oliver Gaul; Gerald Gamrath; Ambros M. Gleixner; Leona Gottwald; Christoph Graczyk; et al. (ACM Trans. Math. Softw., 2023)

Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems. - Stephen J. Maher; Elina Rönnberg (Math. Program. Comput., 2023)

Computational Evaluation of Cut-Strengthening Techniques in Logic-Based Benders' Decomposition. - Aigerim Saken; Emil Karlsson; Stephen J. Maher; Elina Rönnberg (Oper. Res. Forum, 2023)

A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network. - Junko Hosoda; Stephen J. Maher; Yuji Shinano; Jonas Christoffer Villumsen (Comput. Oper. Res., 2024)