Mario Ruthmair

According to our database1, Mario Ruthmair authored at least 24 papers between 2009 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Exact Methods for the Traveling Salesman Problem with Drone.
Transp. Sci., 2021

Large-scale influence maximization via maximal covering location.
Eur. J. Oper. Res., 2021

Analysis of Schedules for Rural First and Last Mile Microtransit Services.
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
Exact Approaches for Network Design Problems with Relays.
INFORMS J. Comput., 2019

Layered graph approaches for combinatorial optimization problems.
Comput. Oper. Res., 2019

Strategies for Iteratively Refining Layered Graph Models.
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

Least cost influence propagation in (social) networks.
Math. Program., 2018

2017
Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem.
Eur. J. Oper. Res., 2017

Bi-objective orienteering for personal activity scheduling.
Comput. Oper. Res., 2017

2015
Load-dependent and precedence-based models for pickup and delivery problems.
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
Spanning trees with variable degree bounds.
Eur. J. Oper. Res., 2014

2013
Stabilizing branch-and-price for constrained tree problems.
Networks, 2013

2012
On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem.
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

Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem.
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


  Loading...