Stephen J. Maher
Orcid: 0000-0003-3773-6882
According to our database1,
Stephen J. Maher
authored at least 25 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network.
Comput. Oper. Res., 2024
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
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
Comput. Oper. Res., 2022
2021
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
2020
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
Math. Program. Comput., 2017
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017
2016
Transp. Sci., 2016
The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences.
Eur. J. Oper. Res., 2016
Proceedings of the Mathematical Software - ICMS 2016, 2016
2015
Comput. Oper. Res., 2015
2014
Comput. Oper. Res., 2014
2013
PhD thesis, 2013