Mario Ruthmair
Orcid: 0000-0002-2318-6667
According to our database1,
Mario Ruthmair
authored at least 26 papers
between 2009 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2023
Transp. Sci., March, 2023
2022
Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption.
Transp. Sci., 2022
2021
Eur. J. Oper. Res., 2021
Proceedings of the Computational Logistics - 12th International Conference, 2021
2020
Corrigendum to "Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem" [European Journal of Operational Research, 262(3) 2017, 908-928].
Eur. J. Oper. Res., 2020
2019
Comput. Oper. Res., 2019
Proceedings of the Hybrid Metaheuristics - 11th International Workshop, 2019
2018
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem.
Networks, 2018
2017
Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem.
Eur. J. Oper. Res., 2017
2015
Comput. Oper. Res., 2015
A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2015
2014
2013
2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles.
Proceedings of the Applications of Evolutionary Computation, 2012
2011
A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
Proceedings of the Network Optimization - 5th International Conference, 2011
A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011
A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011
2010
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
Proceedings of the Parallel Problem Solving from Nature, 2010
2009
Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search.
Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem.
Proceedings of the Computer Aided Systems Theory, 2009