Spanning Tree Problem with Variable Degree Bounds
Benchmark instances can be downloaded here. For details we refer to
- Luis Gouveia, Pedro Moura, Mario Ruthmair, and Amaro Sousa. Spanning Trees with Variable Degree Bounds. European Journal of Operational Research, 239(3):830–841, 2014.
[Bibtex]@Article{Gouveia2014, author = {Gouveia, Luis and Moura, Pedro and Ruthmair, Mario and Sousa, Amaro}, journal = {European Journal of Operational Research}, title = {Spanning Trees with Variable Degree Bounds}, year = {2014}, number = {3}, pages = {830--841}, volume = {239}, doi = {10.1016/j.ejor.2014.05.034}, file = {:pdfs-own/Gouveia2014.pdf:PDF}, timestamp = {2015.05.23}, }
Black-and-White Traveling Salesman Problem
Benchmark instances can be downloaded here. For details we refer to
- Luis Gouveia, Markus Leitner, and Mario Ruthmair. Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem. European Journal of Operational Research, 262(3):908–928, 2017.
[Bibtex]@Article{Gouveia2017, author = {Gouveia, Luis and Leitner, Markus and Ruthmair, Mario}, journal = {European Journal of Operational Research}, title = {Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem}, year = {2017}, number = {3}, pages = {908--928}, volume = {262}, doi = {10.1016/j.ejor.2017.04.061}, file = {:pdfs-own/Gouveia2017.pdf:PDF}, timestamp = {2017-06-163}, }
Generalized Least Cost Influence Problem
Benchmark instances can be downloaded here. For details we refer to
- Matteo Fischetti, Michael Kahr, Markus Leitner, Michele Monaci, and Mario Ruthmair. Least cost influence propagation in (social) networks. Mathematical Programming, 170(1):293–325, 2018.
[Bibtex]@Article{Fischetti2018, author = {Matteo Fischetti and Michael Kahr and Markus Leitner and Michele Monaci and Mario Ruthmair}, journal = {Mathematical Programming}, title = {Least cost influence propagation in (social) networks}, year = {2018}, number = {1}, pages = {293--325}, volume = {170}, doi = {10.1007/s10107-018-1288-y}, file = {:pdfs-own/Fischetti2018.pdf:PDF}, timestamp = {2018-05-127}, }
Traveling Salesman Problem with Drone
Benchmark instances (originally created by Stefan Poikonen) can be downloaded here. Detailed results can be found here.
For details we refer to
- Roberto Roberti and Mario Ruthmair. Exact Methods for the Traveling Salesman Problem with Drone. Transportation Science, 55(2):315–335, 2021.
[Bibtex]@Article{Roberti2021, author = {Roberti, Roberto and Ruthmair, Mario}, journal = {Transportation Science}, title = {Exact Methods for the Traveling Salesman Problem with Drone}, year = {2021}, number = {2}, pages = {315--335}, volume = {55}, doi = {10.1287/trsc.2020.1017}, file = {:pdfs-own/Roberti2021.pdf:PDF}, timestamp = {2021-04-102}, }
Arc routing with electric vehicles
Benchmark instances can be downloaded here. For details we refer to
- Elena Fernández, Markus Leitner, Ivana Ljubić, and Mario Ruthmair. Arc routing with electric vehicles: dynamic charging and speed-dependent energy consumption. Transportation Science, 56(5):1219-1237, 2022.
[Bibtex]@Article{Fernandez2022, author = {Fern{\'{a}}ndez, Elena and Leitner, Markus and Ljubi{\'{c}}, Ivana and Ruthmair, Mario}, journal = {Transportation Science}, title = {Arc routing with electric vehicles: dynamic charging and speed-dependent energy consumption}, year = {2022}, number = {5}, pages = {1219-1237}, volume = {56}, doi = {10.1287/trsc.2022.1126}, file = {:pdfs-own/Fernandez2021.pdf:PDF}, timestamp = {2021-04-103}, }
Multi-depot routing with split deliveries
Benchmark instances (some are originally created by D. Gulczynski) can be downloaded here. For details we refer to
- Luis Gouveia, Markus Leitner, and Mario Ruthmair. Multi-depot routing with split deliveries: Models and a branch-and-cut algorithm. Transportation Science, 57(2):512-530, 2022.
[Bibtex]@Article{Gouveia2022, author = {Gouveia, Luis and Leitner, Markus and Ruthmair, Mario}, journal = {Transportation Science}, title = {Multi-depot routing with split deliveries: Models and a branch-and-cut algorithm}, year = {2022}, number = {2}, pages = {512-530}, volume = {57}, doi = {10.1287/trsc.2022.1179}, file = {:pdfs-own/Gouveia2022.pdf:PDF}, }
Please contact me in case you have questions!