E-LIB Suche - Ergebnisse für: Savelsbergh, Martin W. P.

1

Challenges and opportunities in crowdsourced delivery plann..:

Savelsbergh, Martin W.P ; Ulmer, Marlin W.
4OR. 20 (2022) 1 - p. 1-21 , 2022

2

The vehicle routing problem with heterogeneous locker boxes:

Grabenschweiger, Jasmin ; Doerner, Karl F. ; Hartl, Richard F..
Central European Journal of Operations Research. 29 (2021) 1 - p. 113-142 , 2021

Link: https://doi.org/10.1007/..

3

Logistics optimization for a coal supply chain:

Belov, Gleb ; Boland, Natashia L. ; Savelsbergh, Martin W. P..
Journal of Heuristics. 26 (2020) 2 - p. 269-300 , 2020

Link: https://doi.org/10.1007/..

4

Perspectives on integer programming for time-dependent mode..:

Boland, Natashia L. ; Savelsbergh, Martin W. P.
TOP. 27 (2019) 2 - p. 147-173 , 2019

Link: https://doi.org/10.1007/..

5

Rejoinder on: Perspectives on integer programming for time-..:

Boland, Natashia L. ; Savelsbergh, Martin W. P.
TOP. 27 (2019) 2 - p. 184-186 , 2019

Link: https://doi.org/10.1007/..

6

Complexity of routing problems with release dates and deadl..:

Reyes, Damián ; Erera, Alan L. ; Savelsbergh, Martin W.P.
European Journal of Operational Research. 266 (2018) 1 - p. 29-34 , 2018

Link: https://doi.org/10.1016/..

7

Incremental Network Design with Minimum Spanning Trees:

Engel, Konrad ; Kalinowski, Thomas ; Savelsbergh, Martin W.P.
Journal of Graph Algorithms and Applications. 21 (2017) 4 - p. 417-432 , 2017

Link: https://doi.org/10.7155/..

8

The bi-objective mixed capacitated general routing problem ..:

Halvorsen-Weare, Elin E. ; Savelsbergh, Martin W.P.
European Journal of Operational Research. 251 (2016) 2 - p. 451-465 , 2016

Link: https://doi.org/10.1016/..

9

Scheduling reclaimers serving a stock pad at a coal termina:

Kalinowski, Thomas ; Kapoor, Reena ; Savelsbergh, Martin W. P.
Journal of Scheduling. 20 (2016) 1 - p. 85-101 , 2016

Link: https://doi.org/10.1007/..

10

Incremental network design with maximum flows:

Kalinowski, Thomas ; Matsypura, Dmytro ; Savelsbergh, Martin W.P.
European Journal of Operational Research. 242 (2015) 1 - p. 51-62 , 2015

Link: https://doi.org/10.1016/..

11

A reclaimer scheduling problem arising in coal stockyard ma..:

Angelelli, Enrico ; Kalinowski, Thomas ; Kapoor, Reena.
Journal of Scheduling. 19 (2015) 5 - p. 563-582 , 2015

Link: https://doi.org/10.1007/..

12

Incremental network design with shortest paths:

Baxter, Matthew ; Elgindy, Tarek ; Ernst, Andreas T...
European Journal of Operational Research. 238 (2014) 3 - p. 675-684 , 2014

Link: https://doi.org/10.1016/..

13

Boosting the feasibility pump:

Boland, Natashia L. ; Eberhard, Andrew C. ; Engineer, Faramroze G....
Mathematical Programming Computation. 6 (2014) 3 - p. 255-279 , 2014

Link: https://doi.org/10.1007/..

14

A note on shortest path problems with forbidden paths:

Smith, Olivia J. ; Savelsbergh, Martin W.P.
Networks. 63 (2014) 3 - p. 239-242 , 2014

Link: https://doi.org/10.1002/..

15

Creating schedules and computing operating costs for LTL lo..:

Erera, Alan L. ; Hewitt, Michael ; Savelsbergh, Martin W.P..
Computers & Operations Research. 40 (2013) 3 - p. 691-702 , 2013

Link: https://doi.org/10.1016/..