Stephen J. Maher

Orcid: 0000-0003-3773-6882

According to our database1, Stephen J. Maher authored at least 23 papers between 2014 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Computational Evaluation of Cut-Strengthening Techniques in Logic-Based Benders' Decomposition.
Oper. Res. Forum, September, 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.
Math. Program. Comput., September, 2023

Enabling Research through the SCIP Optimization Suite 8.0.
ACM Trans. Math. Softw., June, 2023

Subproblem Separation in Logic-Based Benders' Decomposition for the Vehicle Routing Problem with Local Congestion.
Proceedings of the 23rd Symposium on Algorithmic Approaches for Transportation Modelling, 2023

2022
Location, transshipment and routing: An adaptive transportation network integrating long-haul and local vehicle routing.
EURO J. Transp. Logist., 2022

A data-driven, variable-speed model for the train timetable rescheduling problem.
Comput. Oper. Res., 2022

2021
Enhancing large neighbourhood search heuristics for Benders' decomposition.
J. Heuristics, 2021

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

Avoiding redundant columns by adding classical Benders cuts to column generation subproblems.
Discret. Optim., 2021

Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms.
CoRR, 2021

2020
Generating hard instances for robust combinatorial optimization.
Eur. J. Oper. Res., 2020

Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition.
Ann. Oper. Res., 2020

2019
Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem.
Networks, 2019

2018
The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints.
Eur. J. Oper. Res., 2018

2017
SCIP-Jack - a solver for STP and variants with parallelization extensions.
Math. Program. Comput., 2017

Exact Methods for Recursive Circle Packing.
CoRR, 2017

Distributed Domain Propagation.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

2016
Solving the Integrated Airline Recovery Problem Using Column-and-Row Generation.
Transp. Sci., 2016

The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences.
Eur. J. Oper. Res., 2016

PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite.
Proceedings of the Mathematical Software - ICMS 2016, 2016

2015
A novel passenger recovery approach for the integrated airline recovery problem.
Comput. Oper. Res., 2015

2014
The Recoverable Robust Tail Assignment Problem.
Transp. Sci., 2014

Recoverable robust single day aircraft maintenance routing problem.
Comput. Oper. Res., 2014


  Loading...