default search action
Stephen J. Maher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Junko Hosoda, Stephen J. Maher
, Yuji Shinano, Jonas Christoffer Villumsen
A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network. Comput. Oper. Res. 165: 106570 (2024) - 2023
- [j18]Stephen J. Maher, Elina Rönnberg:
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. 15(3): 509-548 (2023) - [j17]Aigerim Saken, Emil Karlsson, Stephen J. Maher, Elina Rönnberg:
Computational Evaluation of Cut-Strengthening Techniques in Logic-Based Benders' Decomposition. Oper. Res. Forum 4(3): 62 (2023) - [j16]Ksenia Bestuzheva
Enabling Research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw. 49(2): 22:1-22:21 (2023) - [c3]Aigerim Saken, Stephen J. Maher:
Subproblem Separation in Logic-Based Benders' Decomposition for the Vehicle Routing Problem with Local Congestion. ATMOS 2023: 16:1-16:12 - 2022
- [j15]Edwin Reynolds
A data-driven, variable-speed model for the train timetable rescheduling problem. Comput. Oper. Res. 142: 105719 (2022) - [j14]Junko Hosoda, Stephen J. Maher
Location, transshipment and routing: An adaptive transportation network integrating long-haul and local vehicle routing. EURO J. Transp. Logist. 11: 100091 (2022) - 2021
- [j13]Marco E. Lübbecke, Stephen J. Maher, Jonas T. Witt:
Avoiding redundant columns by adding classical Benders cuts to column generation subproblems. Discret. Optim. 39: 100626 (2021) - [j12]Stephen J. Maher:
Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework. Eur. J. Oper. Res. 290(2): 479-498 (2021) - [j11]Stephen J. Maher
Enhancing large neighbourhood search heuristics for Benders' decomposition. J. Heuristics 27(4): 615-648 (2021) - [i3]Stephen J. Maher, Ted K. Ralphs, Yuji Shinano:
Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms. CoRR abs/2104.10025 (2021) - 2020
- [j10]Ambros M. Gleixner
Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition. Ann. Oper. Res. 284(2): 527-555 (2020) - [j9]Marc Goerigk
Generating hard instances for robust combinatorial optimization. Eur. J. Oper. Res. 280(1): 34-45 (2020)
2010 – 2019
- 2019
- [j8]Daniel Rehfeldt
Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem. Networks 73(2): 206-233 (2019) - 2018
- [j7]Stephen J. Maher, Guy Desaulniers
The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints. Eur. J. Oper. Res. 264(2): 534-547 (2018) - [i2]Marc Goerigk, Stephen J. Maher:
Generating Hard Instances for Robust Combinatorial Optimization. CoRR abs/1811.00824 (2018) - 2017
- [j6]Gerald Gamrath
SCIP-Jack - a solver for STP and variants with parallelization extensions. Math. Program. Comput. 9(2): 231-296 (2017) - [c2]Robert Lion Gottwald, Stephen J. Maher, Yuji Shinano:
Distributed Domain Propagation. SEA 2017: 6:1-6:11 - [i1]Ambros M. Gleixner, Stephen J. Maher, Benjamin Müller, João Pedro Pedroso
Exact Methods for Recursive Circle Packing. CoRR abs/1702.07799 (2017) - 2016
- [j5]Stephen J. Maher, John M. Murray
The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences. Eur. J. Oper. Res. 248(2): 668-680 (2016) - [j4]Stephen J. Maher:
Solving the Integrated Airline Recovery Problem Using Column-and-Row Generation. Transp. Sci. 50(1): 216-239 (2016) - [c1]Stephen J. Maher, Matthias Miltenberger
PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite. ICMS 2016: 301-307 - 2015
- [j3]Stephen J. Maher:
A novel passenger recovery approach for the integrated airline recovery problem. Comput. Oper. Res. 57: 123-137 (2015) - 2014
- [j2]Stephen J. Maher, Guy Desaulniers
Recoverable robust single day aircraft maintenance routing problem. Comput. Oper. Res. 51: 130-145 (2014) - [j1]Gary Froyland
The Recoverable Robust Tail Assignment Problem. Transp. Sci. 48(3): 351-372 (2014) - 2013
- [b1]Stephen J. Maher:
The application of recoverable robustness to airline planning problems. University of New South Wales, Sydney, Australia, 2013
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: