{"id":9,"date":"2015-01-02T13:28:55","date_gmt":"2015-01-02T12:28:55","guid":{"rendered":"http:\/\/mario.ruthmair.at\/?page_id=9"},"modified":"2020-01-07T18:12:49","modified_gmt":"2020-01-07T17:12:49","slug":"publications","status":"publish","type":"page","link":"https:\/\/mario.ruthmair.at\/?page_id=9","title":{"rendered":"Publications"},"content":{"rendered":"

Refereed Journal Articles<\/h1>\n
    \n
  1. \"[PDF]\"\/<\/a> [DOI]<\/a> Elena Fern\u00e1ndez, Markus Leitner, Ivana Ljubi\u0107, and Mario Ruthmair. Arc routing with electric vehicles: dynamic charging and speed-dependent energy consumption. Transportation Science<\/em>, 56(5):1219-1237, 2022.
    [Bibtex]<\/a>\n
    \n
    @Article{Fernandez2022,\nauthor = {Fern{\\'{a}}ndez, Elena and Leitner, Markus and Ljubi{\\'{c}}, Ivana and Ruthmair, Mario},\njournal = {Transportation Science},\ntitle = {Arc routing with electric vehicles: dynamic charging and speed-dependent energy consumption},\nyear = {2022},\nnumber = {5},\npages = {1219-1237},\nvolume = {56},\ndoi = {10.1287\/trsc.2022.1126},\nfile = {:pdfs-own\/Fernandez2021.pdf:PDF},\ntimestamp = {2021-04-103},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  2.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Luis Gouveia, Markus Leitner, and Mario Ruthmair. Multi-depot routing with split deliveries: Models and a branch-and-cut algorithm. Transportation Science<\/em>, 57(2):512-530, 2022. 
            [Bibtex]<\/a>\n
    \n
    @Article{Gouveia2022,\nauthor = {Gouveia, Luis and Leitner, Markus and Ruthmair, Mario},\njournal = {Transportation Science},\ntitle = {Multi-depot routing with split deliveries: Models and a branch-and-cut algorithm},\nyear = {2022},\nnumber = {2},\npages = {512-530},\nvolume = {57},\ndoi = {10.1287\/trsc.2022.1179},\nfile = {:pdfs-own\/Gouveia2022.pdf:PDF},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  3.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Evren G\u00fcney, Markus Leitner, Mario Ruthmair, and Markus Sinnl. Large-scale Influence Maximization via Maximal Covering Location. European Journal of Operational Research<\/em>, 289(1):144\u2013164, 2021. 
            [Bibtex]<\/a>\n
    \n
    @Article{Gueney2021,\nauthor = {G{\\\"u}ney, Evren and Leitner, Markus and Ruthmair, Mario and Sinnl, Markus},\njournal = {European Journal of Operational Research},\ntitle = {Large-scale Influence Maximization via Maximal Covering Location},\nyear = {2021},\nnumber = {1},\npages = {144--164},\nvolume = {289},\ndoi = {10.1016\/j.ejor.2020.06.028},\nfile = {:pdfs-own\/Gueney2021.pdf:PDF},\npublisher = {Elsevier {BV}},\ntimestamp = {2020-12-356},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  4.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Roberto Roberti and Mario Ruthmair. Exact Methods for the Traveling Salesman Problem with Drone. Transportation Science<\/em>, 55(2):315\u2013335, 2021. 
            [Bibtex]<\/a>\n
    \n
    @Article{Roberti2021,\nauthor = {Roberti, Roberto and Ruthmair, Mario},\njournal = {Transportation Science},\ntitle = {Exact Methods for the Traveling Salesman Problem with Drone},\nyear = {2021},\nnumber = {2},\npages = {315--335},\nvolume = {55},\ndoi = {10.1287\/trsc.2020.1017},\nfile = {:pdfs-own\/Roberti2021.pdf:PDF},\ntimestamp = {2021-04-102},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  5.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Michael Kahr, Markus Leitner, Mario Ruthmair, and Markus Sinnl. Benders decomposition for competitive influence maximization in (social) networks. Omega<\/em>, 100:102264, 2021. 
            [Bibtex]<\/a>\n
    \n
    @Article{Kahr2021,\nauthor = {Kahr, Michael and Leitner, Markus and Ruthmair, Mario and Sinnl, Markus},\njournal = {Omega},\ntitle = {Benders decomposition for competitive influence maximization in (social) networks},\nyear = {2021},\npages = {102264},\nvolume = {100},\ndoi = {10.1016\/j.omega.2020.102264},\nfile = {:pdfs-own\/Kahr2021.pdf:PDF},\npublisher = {Elsevier {BV}},\ntimestamp = {2021-01-19},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  6.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Markus Leitner, Ivana Ljubi\u0107, Martin Riedler, and Mario Ruthmair. Exact approaches for the directed network design problem with relays. Omega<\/em>, 91:102005, 2020. 
            [Bibtex]<\/a>\n
    \n
    @Article{Leitner2020,\nauthor = {Markus Leitner and Ivana Ljubi{\\'{c}} and Martin Riedler and Mario Ruthmair},\njournal = {Omega},\ntitle = {Exact approaches for the directed network design problem with relays},\nyear = {2020},\npages = {102005},\nvolume = {91},\ndoi = {10.1016\/j.omega.2018.11.014},\nfile = {:pdfs-own\/Leitner2020.pdf:PDF},\npublisher = {Elsevier {BV}},\ntimestamp = {2018-02-46},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  7.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Luis Gouveia, Markus Leitner, Mario Ruthmair, and 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\u2013928]. European Journal of Operational Research<\/em>, 285(3):1199\u20131203, 2020. 
            [Bibtex]<\/a>\n
    \n
    @Article{Gouveia2020,\nauthor = {Luis Gouveia and Markus Leitner and Mario Ruthmair and Ruslan Sadykov},\njournal = {European Journal of Operational Research},\ntitle = {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\u2013928]},\nyear = {2020},\nnumber = {3},\npages = {1199--1203},\nvolume = {285},\ndoi = {10.1016\/j.ejor.2020.02.039},\nfile = {:pdfs-own\/Gouveia2020.pdf:PDF},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  8.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Luis Gouveia, Markus Leitner, and Mario Ruthmair. Layered graph approaches for combinatorial optimization problems. Computers & Operations Research<\/em>, 102:22\u201338, 2019. 
            [Bibtex]<\/a>\n
    \n
    @Article{Gouveia2019,\nauthor = {Luis Gouveia and Markus Leitner and Mario Ruthmair},\njournal = {Computers \\& Operations Research},\ntitle = {Layered graph approaches for combinatorial optimization problems},\nyear = {2019},\npages = {22--38},\nvolume = {102},\ndoi = {10.1016\/j.cor.2018.09.007},\nfile = {:pdfs-own\/Gouveia2019.pdf:PDF},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  9.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Markus Leitner, Ivana Ljubi\u0107, Martin Riedler, and Mario Ruthmair. Exact Approaches for Network Design Problems with Relays. INFORMS Journal on Computing<\/em>, 31(1):171\u2013192, 2019. 
            [Bibtex]<\/a>\n
    \n
    @Article{Leitner2019,\nauthor = {Markus Leitner and Ivana Ljubi{\\'{c}} and Martin Riedler and Mario Ruthmair},\njournal = {INFORMS Journal on Computing},\ntitle = {Exact Approaches for Network Design Problems with Relays},\nyear = {2019},\nnumber = {1},\npages = {171--192},\nvolume = {31},\ndoi = {10.1287\/ijoc.2018.0820},\nfile = {:pdfs-own\/Leitner2019.pdf:PDF},\ntimestamp = {2018-03-66},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  10.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Matteo Fischetti, Michael Kahr, Markus Leitner, Michele Monaci, and Mario Ruthmair. Least cost influence propagation in (social) networks. Mathematical Programming<\/em>, 170(1):293\u2013325, 2018. 
            [Bibtex]<\/a>\n
    \n
    @Article{Fischetti2018,\nauthor = {Matteo Fischetti and Michael Kahr and Markus Leitner and Michele Monaci and Mario Ruthmair},\njournal = {Mathematical Programming},\ntitle = {Least cost influence propagation in (social) networks},\nyear = {2018},\nnumber = {1},\npages = {293--325},\nvolume = {170},\ndoi = {10.1007\/s10107-018-1288-y},\nfile = {:pdfs-own\/Fischetti2018.pdf:PDF},\ntimestamp = {2018-05-127},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  11.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Luis Gouveia, Pierre Pesneau, Mario Ruthmair, and Daniel Santos. Combining and Projecting Flow Models for the (Precedence Constrained) Asymmetric Traveling Salesman Problem. Networks<\/em>, 71(4):451\u2013465, 2018. 
            [Bibtex]<\/a>\n
    \n
    @Article{Gouveia2018a,\nauthor = {Gouveia, Luis and Pesneau, Pierre and Ruthmair, Mario and Santos, Daniel},\njournal = {Networks},\ntitle = {Combining and Projecting Flow Models for the (Precedence Constrained) Asymmetric Traveling Salesman Problem},\nyear = {2018},\nnumber = {4},\npages = {451--465},\nvolume = {71},\ndoi = {10.1002\/net.21765},\nfile = {:pdfs-own\/Gouveia2018a.pdf:PDF},\ntimestamp = {2018-05-132},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  12.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           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<\/em>, 262(3):908\u2013928, 2017. 
            [Bibtex]<\/a>\n
    \n
    @Article{Gouveia2017,\nauthor = {Gouveia, Luis and Leitner, Markus and Ruthmair, Mario},\njournal = {European Journal of Operational Research},\ntitle = {Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem},\nyear = {2017},\nnumber = {3},\npages = {908--928},\nvolume = {262},\ndoi = {10.1016\/j.ejor.2017.04.061},\nfile = {:pdfs-own\/Gouveia2017.pdf:PDF},\ntimestamp = {2017-06-163},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  13.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Piotr Matl, Pamela C. Nolz, Ulrike Ritzinger, Mario Ruthmair, and Fabien Tricoire. Bi-objective orienteering for personal activity scheduling. Computers & Operations Research<\/em>, 82:69\u201382, 2017. 
            [Bibtex]<\/a>\n
    \n
    @Article{Matl2017,\nauthor = {Piotr Matl and Pamela C. Nolz and Ulrike Ritzinger and Mario Ruthmair and Fabien Tricoire},\njournal = {Computers \\& Operations Research},\ntitle = {Bi-objective orienteering for personal activity scheduling},\nyear = {2017},\nissn = {0305-0548},\npages = {69--82},\nvolume = {82},\ndoi = {10.1016\/j.cor.2017.01.009},\nfile = {:pdfs-own\/Matl2017.pdf:PDF},\ntimestamp = {2017-01-31},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  14.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Johannes Asamer, Anita Graser, Bernhard Heilmann, and Mario Ruthmair. Sensitivity Analysis for Energy Demand Estimation of Electric Vehicles. Transportation Research Part D: Transport and Environment<\/em>, 46:182\u2013199, 2016. 
            [Bibtex]<\/a>\n
    \n
    @Article{Asamer2016a,\nauthor = {Johannes Asamer and Anita Graser and Bernhard Heilmann and Mario Ruthmair},\njournal = {Transportation Research Part D: Transport and Environment},\ntitle = {Sensitivity Analysis for Energy Demand Estimation of Electric Vehicles},\nyear = {2016},\npages = {182--199},\nvolume = {46},\ndoi = {10.1016\/j.trd.2016.03.017},\nfile = {:pdfs-own\/Asamer2016a.pdf:PDF},\ntimestamp = {2016-07-204},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  15.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Johannes Asamer, Martin Reinthaler, Mario Ruthmair, Markus Straub, and Jakob Puchinger. Optimizing Charging Station Locations for Urban Taxi Providers. Transportation Research Part A: Policy and Practice<\/em>, 85:233\u2013246, 2016. 
            [Bibtex]<\/a>\n
    \n
    @Article{Asamer2016,\nauthor = {Johannes Asamer and Martin Reinthaler and Mario Ruthmair and Markus Straub and Jakob Puchinger},\njournal = {Transportation Research Part A: Policy and Practice},\ntitle = {Optimizing Charging Station Locations for Urban Taxi Providers},\nyear = {2016},\npages = {233--246},\nvolume = {85},\ndoi = {10.1016\/j.tra.2016.01.014},\nfile = {:pdfs-own\/Asamer2016.pdf:PDF},\ntimestamp = {2016-02-43},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  16.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Liujiang Kang, Xiaoning Zhu, Jianjun Wu, Jakob Puchinger, Mario Ruthmair, and Bin Hu. Modeling and solving the first train timetabling problem with minimal missed trains in subway networks. Transportation Research Part B: Methodological<\/em>, 93, Part A:17\u201336, 2016. 
            [Bibtex]<\/a>\n
    \n
    @Article{Kang2016,\nauthor = {Liujiang Kang and Xiaoning Zhu and Jianjun Wu and Jakob Puchinger and Mario Ruthmair and Bin Hu},\njournal = {Transportation Research Part B: Methodological},\ntitle = {Modeling and solving the first train timetabling problem with minimal missed trains in subway networks},\nyear = {2016},\nissn = {0191-2615},\npages = {17--36},\nvolume = {93, Part A},\ndoi = {10.1016\/j.trb.2016.07.006},\nfile = {:pdfs-own\/Kang2016.pdf:PDF},\ntimestamp = {2016-07-204},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  17.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Luis Gouveia and Mario Ruthmair. Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems. Computers & Operations Research<\/em>, 63:56\u201371, 2015. 
            [Bibtex]<\/a>\n
    \n
    @Article{Gouveia2015,\nauthor = {Gouveia, Luis and Ruthmair, Mario},\njournal = {Computers \\& Operations Research},\ntitle = {Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems},\nyear = {2015},\npages = {56--71},\nvolume = {63},\ndoi = {10.1016\/j.cor.2015.04.008},\nfile = {:pdfs-own\/Gouveia2015.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  18.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Luis Gouveia, Pedro Moura, Mario Ruthmair, and Amaro Sousa. Spanning Trees with Variable Degree Bounds. European Journal of Operational Research<\/em>, 239(3):830\u2013841, 2014. 
            [Bibtex]<\/a>\n
    \n
    @Article{Gouveia2014,\nauthor = {Gouveia, Luis and Moura, Pedro and Ruthmair, Mario and Sousa, Amaro},\njournal = {European Journal of Operational Research},\ntitle = {Spanning Trees with Variable Degree Bounds},\nyear = {2014},\nnumber = {3},\npages = {830--841},\nvolume = {239},\ndoi = {10.1016\/j.ejor.2014.05.034},\nfile = {:pdfs-own\/Gouveia2014.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
  19.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Markus Leitner, Mario Ruthmair, and G\u00fcnther R. Raidl. Stabilizing Branch-and-Price for Constrained Tree Problems. Networks<\/em>, 61(2):150\u2013170, 2013. 
            [Bibtex]<\/a>\n
    \n
    @Article{Leitner2013,\nauthor = {Leitner, Markus and Ruthmair, Mario and Raidl, G{\\\"u}nther R.},\njournal = {Networks},\ntitle = {Stabilizing Branch-and-Price for Constrained Tree Problems},\nyear = {2013},\nnumber = {2},\npages = {150--170},\nvolume = {61},\ndoi = {10.1002\/net.21484},\nfile = {:pdfs-own\/Leitner2013.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<\/ul>\n
    Book Chapters<\/h1>\n
      \n
    1.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Georg Brandst\u00e4tter, Claudio Gambella, Markus Leitner, Enrico Malaguti, Filippo Masini, Jakob Puchinger, Mario Ruthmair, and Daniele Vigo. Overview of Optimization Problems in Electric Car-Sharing System Design and Management. In Herbert Dawid, Karl F. Doerner, Gustav Feichtinger, Peter M. Kort, and Andrea Seidl, editors, Dynamic Perspectives on Managerial Decision Making<\/em>, volume 22 of Dynamic Modeling and Econometrics in Economics and Finance<\/em>, page 441\u2013471. Springer, Berlin, 2016. 
                [Bibtex]<\/a>\n
      \n
      @InCollection{Brandstaetter2016,\nauthor = {Georg Brandst{\\\"{a}}tter and Claudio Gambella and Markus Leitner and Enrico Malaguti and Filippo Masini and Jakob Puchinger and Mario Ruthmair and Daniele Vigo},\nbooktitle = {Dynamic Perspectives on Managerial Decision Making},\npublisher = {Springer, Berlin},\ntitle = {Overview of Optimization Problems in Electric Car-Sharing System Design and Management},\nyear = {2016},\neditor = {Herbert Dawid and Karl F. Doerner and Gustav Feichtinger and Kort, Peter M. and Andrea Seidl},\npages = {441--471},\nseries = {Dynamic Modeling and Econometrics in Economics and Finance},\nvolume = {22},\ndoi = {10.1007\/978-3-319-39120-5_24},\nfile = {:pdfs-own\/Brandstaetter2016.pdf:PDF},\ntimestamp = {2016-11-330},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
    2.          \"[PDF]\"\/<\/a>              Luis Gouveia, Mario Ruthmair, and Daniel Santos. Um modelo de fluxo para o electric traveling salesman problem. In C. H. Antunes, D. M. Cardoso, and F. N. da Silva, editors, A Investiga\u00e7\u00e3o Operacional em Portugal – novos desafios novas ideias, homenagem ao Professor Lu\u00eds Valadares Tavares<\/em>, page 133\u2013143. IST Press, Lisboa, 2016. 
                [Bibtex]<\/a>\n
      \n
      @InCollection{Gouveia2016,\nauthor = {Gouveia, Luis and Ruthmair, Mario and Santos, Daniel},\nbooktitle = {A Investiga{\\c{c}}\\~ao Operacional em {Portugal} - novos desafios novas ideias, homenagem ao Professor Lu{\\'{i}}s Valadares Tavares},\npublisher = {IST Press, Lisboa},\ntitle = {Um modelo de fluxo para o electric traveling salesman problem},\nyear = {2016},\neditor = {Antunes, C.H. and Cardoso, D.M. and da Silva, F.N.},\npages = {133--143},\nfile = {:pdfs-own\/Gouveia2016.pdf:PDF},\ntimestamp = {2016-05-145},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<\/ul>\n
      Refereed Conference Papers<\/h1>\n
        \n
      1.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Christian Truden, Mario Ruthmair, and Martin J. Kollingbaum. Analysis of Schedules for Rural First and Last Mile Microtransit Services. In Martijn Mes, Eduardo Lalla-Ruiz, and Stefan Vo\u00df, editors, Computational Logistics<\/em>, page 332\u2013346.  Springer International Publishing, 2021. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Truden2021,\nauthor = {Truden, Christian and Ruthmair, Mario and Kollingbaum, Martin J.},\nbooktitle = {Computational Logistics},\ntitle = {Analysis of Schedules for Rural First and Last Mile Microtransit Services},\nyear = {2021},\neditor = {Mes, Martijn and Lalla-Ruiz, Eduardo and Vo{\\ss}, Stefan},\npages = {332--346},\npublisher = {Springer International Publishing},\nabstract = {Low and infrequent demand in rural areas poses a problem for public transport providers to run cost-effective services and individual car use is usually the main means of transportation. We investigate how microtransit services can be integrated with existing public transport solutions (bus, train) as a flexible shared mobility alternative in rural areas and how to make them attractive alternatives to individual car use. We combine large neighborhood search with agent-based modeling and simulation to validate generated schedules for a microtransit service in terms of vulnerability to tardiness in passenger behavior or service provision. This includes the study of how disturbances, such as delays in service provision or late arrivals of passengers affect the stability of a transport schedule concerning a reliable timely delivery to transfer stops. We explore how simulation can be utilized as a means to fine-tune provider policies, e.g., how long vehicles may wait for late passengers before they depart.},\ndoi = {10.1007\/978-3-030-87672-2_22},\nfile = {:pdfs-own\/Truden2021.pdf:PDF},\nisbn = {978-3-030-87672-2},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
      2.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Martin Riedler, G\u00fcnther R. Raidl, and Mario Ruthmair. Strategies for Iteratively Refining Layered Graph Models. In Maria J. Blesa, Christian Blum, Haroldo Gambini Santos, Pedro Pinacho-Davidson, and Julio Godoy del Campo, editors, Proceedings of the 11th International Workshop on Hybrid Metaheuristics<\/em>, volume 11299 of LNCS<\/em>, pages 46-62.  Springer, 2019. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Riedler2019,\nauthor = {Riedler, Martin and Raidl, G\u00fcnther R. and Ruthmair, Mario},\nbooktitle = {Proceedings of the 11th International Workshop on Hybrid Metaheuristics},\ntitle = {Strategies for Iteratively Refining Layered Graph Models},\nyear = {2019},\neditor = {Blesa, Maria J. and Blum, Christian and Gambini Santos, Haroldo and Pinacho-Davidson, Pedro and Godoy del Campo, Julio},\npages = {46-62},\npublisher = {Springer},\nseries = {LNCS},\nvolume = {11299},\ndoi = {10.1007\/978-3-030-05983-5_4},\nfile = {:pdfs-own\/Riedler2019.pdf:PDF},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
      3.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Matthias Prandtstetter, Ulrike Ritzinger, Peter Schmidt, and Mario Ruthmair. A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem. In Gabriela Ochoa and Francisco Chicano, editors, Evolutionary Computation in Combinatorial Optimization<\/em>, volume 9026 of LNCS<\/em>, page 36\u201347.  Springer, 2015. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Prandtstetter2015,\nauthor = {Prandtstetter, Matthias and Ritzinger, Ulrike and Schmidt, Peter and Ruthmair, Mario},\nbooktitle = {Evolutionary Computation in Combinatorial Optimization},\ntitle = {A Variable Neighborhood Search Approach for the Interdependent Lock Scheduling Problem},\nyear = {2015},\neditor = {Ochoa, Gabriela and Chicano, Francisco},\npages = {36--47},\npublisher = {Springer},\nseries = {LNCS},\nvolume = {9026},\ndoi = {10.1007\/978-3-319-16468-7_4},\nfile = {:pdfs-own\/Prandtstetter2015.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
      4.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Martin Berlakovich, Mario Ruthmair, and G\u00fcnther R. Raidl. A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In R. Moreno-D\u00edaz, F. Pichler, and A. Quesada-Arencibia, editors, Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I<\/em>, volume 6927 of LNCS<\/em>, page 256\u2013263.  Springer, 2012. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Berlakovich2012,\nauthor = {Berlakovich, Martin and Ruthmair, Mario and Raidl, G{\\\"u}nther R.},\nbooktitle = {Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I},\ntitle = {A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem},\nyear = {2012},\neditor = {Moreno-D{\\'i}az, R. and Pichler, F. and Quesada-Arencibia, A.},\npages = {256--263},\npublisher = {Springer},\nseries = {LNCS},\nvolume = {6927},\ndoi = {10.1007\/978-3-642-27549-4_33},\nfile = {:pdfs-own\/Berlakovich2012.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
      5.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Thorsten Krenek, Mario Ruthmair, and G\u00fcnther R. Raidl. Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles. In Di C. Chio and others, editors, Proceedings of the European Conference on the Applications of Evolutionary Computation<\/em>, volume 7248 of LNCS<\/em>, page 376\u2013385.  Springer, 2012. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Krenek2012,\nauthor = {Krenek, Thorsten and Ruthmair, Mario and Raidl, G{\\\"u}nther R.},\nbooktitle = {Proceedings of the European Conference on the Applications of Evolutionary Computation},\ntitle = {Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles},\nyear = {2012},\neditor = {Chio, C. Di and others},\npages = {376--385},\npublisher = {Springer},\nseries = {LNCS},\nvolume = {7248},\ndoi = {10.1007\/978-3-642-29178-4_38},\nfile = {:pdfs-own\/Krenek2012.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
      6.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Mario Ruthmair and G\u00fcnther R. Raidl. On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem. In A. R. Mahjoub and others, editors, Proceedings of the 2nd International Symposium on Combinatorial Optimization<\/em>, volume 7422 of LNCS<\/em>, page 225\u2013236.  Springer, 2012. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Ruthmair2012a,\nauthor = {Ruthmair, Mario and Raidl, G{\\\"u}nther R.},\nbooktitle = {Proceedings of the 2nd International Symposium on Combinatorial Optimization},\ntitle = {On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem},\nyear = {2012},\neditor = {Mahjoub, A.R. and others},\npages = {225--236},\npublisher = {Springer},\nseries = {LNCS},\nvolume = {7422},\ndoi = {10.1007\/978-3-642-32147-4_21},\nfile = {:pdfs-own\/Ruthmair2012a.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
      7.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Mario Ruthmair and G\u00fcnther R. Raidl. A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In R. Moreno-D\u00edaz, F. Pichler, and A. Quesada-Arencibia, editors, Proceedings of the 13\\textsuperscriptth International Conference on Computer Aided Systems Theory: Part I<\/em>, volume 6927 of LNCS<\/em>, page 351\u2013358.  Springer, 2012. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Ruthmair2012b,\nauthor = {Ruthmair, Mario and Raidl, G{\\\"u}nther R.},\nbooktitle = {Proceedings of the 13\\textsuperscript{th} International Conference on Computer Aided Systems Theory: Part I},\ntitle = {A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem},\nyear = {2012},\neditor = {Moreno-D{\\'i}az, R. and Pichler, F. and Quesada-Arencibia, A.},\npages = {351--358},\npublisher = {Springer},\nseries = {LNCS},\nvolume = {6927},\ndoi = {10.1007\/978-3-642-27549-4_45},\nfile = {:pdfs-own\/Ruthmair2012b.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
      8.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Markus Leitner, Mario Ruthmair, and G\u00fcnther R. Raidl. Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem. In J. Pahl, T. Reiners, and S. Vo\u00df, editors, Network Optimization: 5th International Conference, INOC 2011<\/em>, volume 6701 of LNCS<\/em>, page 124\u2013138, Hamburg, Germany, 2011. Springer. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Leitner2011,\nauthor = {Leitner, Markus and Ruthmair, Mario and Raidl, G{\\\"u}nther R.},\nbooktitle = {Network Optimization: 5th International Conference, INOC 2011},\ntitle = {Stabilized Branch-and-Price for the Rooted Delay-Constrained {S}teiner Tree Problem},\nyear = {2011},\naddress = {Hamburg, Germany},\neditor = {Pahl, J. and Reiners, T. and Vo{\\ss}, S.},\npages = {124--138},\npublisher = {Springer},\nseries = {LNCS},\nvolume = {6701},\ndoi = {10.1007\/978-3-642-21527-8_16},\nfile = {:pdfs-own\/Leitner2011.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
      9.          \"[PDF]\"\/<\/a>              Markus Leitner, Mario Ruthmair, and G\u00fcnther R. Raidl. Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem. In Proceedings of the VII ALIO\/EURO \u2013 Workshop on Applied Combinatorial Optimization<\/em>, page 250\u2013253, Porto, Portugal, 2011. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Leitner2011a,\nauthor = {Leitner, Markus and Ruthmair, Mario and Raidl, G{\\\"u}nther R.},\nbooktitle = {Proceedings of the VII ALIO\/EURO -- Workshop on Applied Combinatorial Optimization},\ntitle = {Stabilized Column Generation for the Rooted Delay-Constrained {S}teiner Tree Problem},\nyear = {2011},\naddress = {Porto, Portugal},\npages = {250--253},\nfile = {:pdfs-own\/Leitner2011a.pdf:PDF},\ntimestamp = {2015-01-26},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
      10.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Mario Ruthmair and G\u00fcnther R. Raidl. A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. In O. G\u00fcnl\u00fck and G. J. Woeginger, editors, Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (IPCO XV)<\/em>, volume 6655 of LNCS<\/em>, page 376\u2013388.  Springer, 2011. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Ruthmair2011a,\nauthor = {Ruthmair, Mario and Raidl, G{\\\"u}nther R.},\nbooktitle = {Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (IPCO XV)},\ntitle = {A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems},\nyear = {2011},\neditor = {G{\\\"u}nl{\\\"u}k, O. and Woeginger, G.J.},\npages = {376--388},\npublisher = {Springer},\nseries = {LNCS},\nvolume = {6655},\ndoi = {10.1007\/978-3-642-20807-2_30},\nfile = {:pdfs-own\/Ruthmair2011a.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
      11.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Mario Ruthmair and G\u00fcnther R. Raidl. Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In R. Schaefer and others, editors, Proceedings of the 11th International Conference on Parallel Problem Solving from Nature: Part II<\/em>, volume 6239 of LNCS<\/em>, page 391\u2013400.  Springer, 2010. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Ruthmair2010,\nauthor = {Ruthmair, Mario and Raidl, G{\\\"u}nther R.},\nbooktitle = {Proceedings of the 11th International Conference on Parallel Problem Solving from Nature: Part II},\ntitle = {Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem},\nyear = {2010},\neditor = {Schaefer, R. and others},\npages = {391--400},\npublisher = {Springer},\nseries = {LNCS},\nvolume = {6239},\ndoi = {10.1007\/978-3-642-15871-1_40},\nfile = {:pdfs-own\/Ruthmair2010.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
      12.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Mario Ruthmair and G\u00fcnther R. Raidl. A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In R. Moreno-D\u00edaz, F. Pichler, and A. Quesada-Arencibia, editors, Proceedings of the 12th International Conference on Computer Aided Systems Theory<\/em>, volume 5717 of LNCS<\/em>, page 713\u2013720.  Springer, 2009. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Ruthmair2009,\nauthor = {Ruthmair, Mario and Raidl, G{\\\"u}nther R.},\nbooktitle = {Proceedings of the 12th International Conference on Computer Aided Systems Theory},\ntitle = {A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem},\nyear = {2009},\neditor = {Moreno-D{\\'i}az, R. and Pichler, F. and Quesada-Arencibia, A.},\npages = {713--720},\npublisher = {Springer},\nseries = {LNCS},\nvolume = {5717},\ndoi = {10.1007\/978-3-642-04772-5_92},\nfile = {:pdfs-own\/Ruthmair2009.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
      13.          \"[PDF]\"\/<\/a>   [DOI]<\/a>           Jakob Walla, Mario Ruthmair, and G\u00fcnther R. Raidl. Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search. In M. J. Blesa and others, editors, Hybrid Metaheuristics 2009<\/em>, volume 5818 of LNCS<\/em>, page 84\u201399.  Springer, 2009. 
                    [Bibtex]<\/a>\n
        \n
        @InProceedings{Walla2009a,\nauthor = {Walla, Jakob and Ruthmair, Mario and Raidl, G{\\\"u}nther R.},\nbooktitle = {Hybrid Metaheuristics 2009},\ntitle = {Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search},\nyear = {2009},\neditor = {Blesa, M. J. and others},\npages = {84--99},\npublisher = {Springer},\nseries = {LNCS},\nvolume = {5818},\ndoi = {10.1007\/978-3-642-04918-7_7},\nfile = {:pdfs-own\/Walla2009a.pdf:PDF},\ntimestamp = {2015.05.23},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<\/ul>\n
        Co-Edited Books \/ Proceedings<\/h1>\n
          \n
        1.            [DOI]<\/a>           Ana Paias, Mario Ruthmair, and Stefan Vo\u00df, editors. Computational Logistics: 7th International Conference, ICCL 2016<\/em>, volume 9855 of LNCS<\/em>, Lisbon, Portugal, 2016. Springer. 
                        [Bibtex]<\/a>\n
          \n
          @Proceedings{Paias2016,\ntitle = {Computational Logistics: 7th International Conference, ICCL 2016},\nyear = {2016},\naddress = {Lisbon, Portugal},\neditor = {Paias, Ana and Ruthmair, Mario and Vo\u00df, Stefan},\nisbn = {978-3-319-44896-1},\npublisher = {Springer},\nseries = {LNCS},\nvolume = {9855},\ndoi = {10.1007\/978-3-319-44896-1},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<\/ul>\n
          Technical Reports<\/h1>\n
          Theses<\/h1>\n
            \n
          1.          \"[PDF]\"\/<\/a>              Mario Ruthmair. On Solving Constrained Tree Problems and an Adaptive Layers Framework<\/em>. PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, 2012. supervised by G.R. Raidl and U. Pferschy 
                            [Bibtex]<\/a>\n
            \n
            @PhdThesis{Ruthmair2012,\nauthor = {Ruthmair, Mario},\nschool = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},\ntitle = {On Solving Constrained Tree Problems and an Adaptive Layers Framework},\nyear = {2012},\naddress = {Vienna, Austria},\nmonth = may,\nnote = {supervised by G.R. Raidl and U. Pferschy},\nfile = {:pdfs-own\/Ruthmair2012.pdf:PDF},\npages = {187},\ntimestamp = {2015-01-26},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n
          2.          \"[PDF]\"\/<\/a>              Mario Ruthmair. Gateway zur \u00dcbertragung von Audiodaten von einem RTSP-Server in ein IEEE1394-Netzwerk. Master’s thesis, Vienna University of Technology, Institute of Computer Technology, Vienna, Austria, 2006. 
                            [Bibtex]<\/a>\n
            \n
            @MastersThesis{Ruthmair2006,\nauthor = {Ruthmair, Mario},\nschool = {Vienna University of Technology, Institute of Computer Technology},\ntitle = {Gateway zur {\\\"U}bertragung von Audiodaten von einem RTSP-Server in ein IEEE1394-Netzwerk},\nyear = {2006},\naddress = {Vienna, Austria},\nmonth = mar,\nfile = {:pdfs-own\/Ruthmair2006.pdf:PDF},\ntimestamp = {2015-01-26},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"
            Refereed Journal Articles Elena Fern\u00e1ndez, Markus Leitner, Ivana Ljubi\u0107, 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 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":4,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-9","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/pages\/9","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=9"}],"version-history":[{"count":38,"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/pages\/9\/revisions"}],"predecessor-version":[{"id":376,"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/pages\/9\/revisions\/376"}],"wp:attachment":[{"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=9"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}