default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMario Ruthmair
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Luís Gouveia
, Markus Leitner, Mario Ruthmair:
Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm. Transp. Sci. 57(2): 512-530 (2023)- 2022
- [j13]Elena Fernández, Markus Leitner, Ivana Ljubic, Mario Ruthmair:
Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption. Transp. Sci. 56(5): 1219-1237 (2022) - 2021
- [j12]Evren Güney, Markus Leitner, Mario Ruthmair, Markus Sinnl:
Large-scale influence maximization via maximal covering location. Eur. J. Oper. Res. 289(1): 144-164 (2021) - [j11]Roberto Roberti, Mario Ruthmair:
Exact Methods for the Traveling Salesman Problem with Drone. Transp. Sci. 55(2): 315-335 (2021) - [c12]Christian Truden, Mario Ruthmair, Martin J. Kollingbaum:
Analysis of Schedules for Rural First and Last Mile Microtransit Services. ICCL 2021: 332-346 - 2020
- [j10]Luis Gouveia, Markus Leitner, Mario Ruthmair, Ruslan Sadykov:
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. 285(3): 1199-1203 (2020)
2010 – 2019
- 2019
- [j9]Luis Gouveia, Markus Leitner, Mario Ruthmair:
Layered graph approaches for combinatorial optimization problems. Comput. Oper. Res. 102: 22-38 (2019) - [j8]Markus Leitner, Ivana Ljubic, Martin Riedler, Mario Ruthmair:
Exact Approaches for Network Design Problems with Relays. INFORMS J. Comput. 31(1): 171-192 (2019) - [c11]Martin Riedler, Mario Ruthmair, Günther R. Raidl:
Strategies for Iteratively Refining Layered Graph Models. HM 2019: 46-62 - 2018
- [j7]Matteo Fischetti, Michael Kahr, Markus Leitner, Michele Monaci, Mario Ruthmair:
Least cost influence propagation in (social) networks. Math. Program. 170(1): 293-325 (2018) - [j6]Luis Gouveia, Pierre Pesneau, Mario Ruthmair, Daniel Santos:
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem. Networks 71(4): 451-465 (2018) - 2017
- [j5]Piotr Matl, Pamela C. Nolz, Ulrike Ritzinger, Mario Ruthmair, Fabien Tricoire:
Bi-objective orienteering for personal activity scheduling. Comput. Oper. Res. 82: 69-82 (2017) - [j4]Luis Eduardo Neves Gouveia, Markus Leitner, Mario Ruthmair:
Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem. Eur. J. Oper. Res. 262(3): 908-928 (2017) - 2016
- [e1]Ana Paias, Mario Ruthmair, Stefan Voß:
Computational Logistics - 7th International Conference, ICCL 2016, Lisbon, Portugal, September 7-9, 2016, Proceedings. Lecture Notes in Computer Science 9855, Springer 2016, ISBN 978-3-319-44895-4 [contents] - 2015
- [j3]Luis Eduardo Neves Gouveia, Mario Ruthmair:
Load-dependent and precedence-based models for pickup and delivery problems. Comput. Oper. Res. 63: 56-71 (2015) - [c10]Matthias Prandtstetter, Ulrike Ritzinger, Peter Schmidt, Mario Ruthmair:
A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem. EvoCOP 2015: 36-47 - 2014
- [j2]Luis Eduardo Neves Gouveia, Pedro Moura, Mario Ruthmair, Amaro de Sousa:
Spanning trees with variable degree bounds. Eur. J. Oper. Res. 239(3): 830-841 (2014) - 2013
- [j1]Markus Leitner, Mario Ruthmair, Günther R. Raidl:
Stabilizing branch-and-price for constrained tree problems. Networks 61(2): 150-170 (2013) - 2012
- [c9]Thorsten Krenek, Mario Ruthmair, Günther R. Raidl, Michael Planer:
Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles. EvoApplications 2012: 376-385 - [c8]Mario Ruthmair, Günther R. Raidl:
On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem. ISCO 2012: 225-236 - 2011
- [c7]Martin Berlakovich, Mario Ruthmair, Günther R. Raidl:
A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST (1) 2011: 256-263 - [c6]Mario Ruthmair, Günther R. Raidl:
A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST (1) 2011: 351-358 - [c5]Markus Leitner, Mario Ruthmair, Günther R. Raidl:
Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem. INOC 2011: 124-138 - [c4]Mario Ruthmair, Günther R. Raidl:
A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. IPCO 2011: 376-388 - 2010
- [c3]Mario Ruthmair, Günther R. Raidl:
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem. PPSN (2) 2010: 391-400
2000 – 2009
- 2009
- [c2]Mario Ruthmair, Günther R. Raidl:
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. EUROCAST 2009: 713-720 - [c1]Jakob Walla, Mario Ruthmair, Günther R. Raidl:
Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search. Hybrid Metaheuristics 2009: 84-99
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
