Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Stephen J. Maher"'
Publikováno v:
EURO Journal on Transportation and Logistics, Vol 11, Iss , Pp 100091- (2022)
The routing of commodities is a tactical problem in supply chain management that aims to synchronise transportation services connecting a network of warehouses and consolidation locations. This paper considers the routing of commodities in a transpor
Externí odkaz:
https://doaj.org/article/34e0c1f3bcee43dca3c0fca35d64b0ed
Autor:
Stephen J. Maher, Elina Rönnberg
Publikováno v:
Mathematical Programming Computation.
Large-neighbourhood search (LNS) heuristics are important mathematical programming techniques that search for primal feasible solutions by solving an auxiliary problem with a restricted feasible region. Extending such powerful generic LNS heuristics
Autor:
Ksenia Bestuzheva, Mathieu Besançon, Wei-Kun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros Gleixner, Leona Gottwald, Christoph Graczyk, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco Lübbecke, Stephen J. Maher, Frederic Matter, Erik Mühmer, Benjamin Müller, Marc E. Pfetsch, Daniel Rehfeldt, Steffan Schlein, Franziska SchlÃŰsser, Felipe Serrano, Yuji Shinano, Boro Sofranac, Mark Turner, Stefan Vigerske, Fabian Wegscheider, Philipp Wellner, Dieter Weninger, Jakob Witzig
Publikováno v:
ACM Transactions on Mathematical Software.
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP . The focus of this paper is on the role of the SCIP Optimization Suite in supporti
Autor:
Stephen J. Maher
Publikováno v:
European Journal of Operational Research. 290:479-498
Benders’ decomposition is a popular mathematical and constraint programming algorithm that is widely applied to exploit problem structure arising from real-world applications. While useful for exploiting structure in mathematical and constraint pro
Autor:
Stephen J. Maher
Publikováno v:
Journal of Heuristics. 27:615-648
A general enhancement of the Benders’ decomposition (BD) algorithm can be achieved through the improved use of large neighbourhood search heuristics within mixed-integer programming solvers. While mixed-integer programming solvers are endowed with
Autor:
Stephen J. Maher, Marc Goerigk
Publikováno v:
European Journal of Operational Research. 280:34-45
While research in robust optimization has attracted considerable interest over the last decades, its algorithmic development has been hindered by several factors. One of them is a missing set of benchmark instances that make algorithm performance bet
Autor:
Edwin Reynolds, Stephen J. Maher
Publikováno v:
Computers & Operations Research. 142:105719
Publikováno v:
Annals of Operations Research. 284:527-555
Packing rings into a minimum number of rectangles is an optimization problem which appears naturally in the logistics operations of the tube industry. It encompasses two major difficulties, namely the positioning of rings in rectangles and the recurs
Publikováno v:
Networks. 73:206-233
The concept of reduction has frequently distinguished itself as a pivotal ingredient of exact solving approaches for the Steiner tree problem in graphs. In this article we broaden the focus and consider reduction techniques for three Steiner problem
Autor:
Cheng-Lung Wu, Stephen J Maher
Publikováno v:
Air Transport Management ISBN: 9780429299445
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77cc8e69e8e4d6fc7132bb908741dec6
https://doi.org/10.4324/9780429299445-12
https://doi.org/10.4324/9780429299445-12