{"id":226,"date":"2017-03-01T00:26:34","date_gmt":"2017-02-28T23:26:34","guid":{"rendered":"http:\/\/mario.ruthmair.at\/?page_id=226"},"modified":"2022-10-17T20:21:37","modified_gmt":"2022-10-17T19:21:37","slug":"instances","status":"publish","type":"page","link":"https:\/\/mario.ruthmair.at\/?page_id=226","title":{"rendered":"Problem Data"},"content":{"rendered":"<p><strong>Spanning Tree Problem with Variable Degree Bounds<\/strong><\/p>\n<p>Benchmark instances can be downloaded <a href=\"http:\/\/mario.ruthmair.at\/wp-content\/uploads\/2017\/03\/stvdb_instances.zip\">here<\/a>. For details we refer to<br \/><ul class=\"papercite_bibliography\">       <li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/gouveia2014.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>   <a href='http:\/\/dx.doi.org\/10.1016\/j.ejor.2014.05.034' class='papercite_doi' title='View document on publisher site'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/external.png' width='10' height='10' alt='[DOI]' \/><\/a>           Luis Gouveia, Pedro Moura, Mario Ruthmair, and Amaro Sousa. Spanning Trees with Variable Degree Bounds. <em>European Journal of Operational Research<\/em>, 239(3):830\u2013841, 2014. <br\/>    <a href=\"javascript:void(0)\" id=\"papercite_0\" class=\"papercite_toggle\">[Bibtex]<\/a>    <div class=\"papercite_bibtex\" id=\"papercite_0_block\"><pre><code class=\"tex bibtex\">@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><\/div>         <\/li>           <\/ul><\/p>\n<p><strong>Black-and-White Traveling Salesman Problem<\/strong><\/p>\n<p>Benchmark instances can be downloaded <a href=\"http:\/\/mario.ruthmair.at\/wp-content\/uploads\/2017\/10\/bwtsp_instances.zip\">here<\/a>. For details we refer to<br \/><ul class=\"papercite_bibliography\">       <li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/gouveia2017.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>   <a href='http:\/\/dx.doi.org\/10.1016\/j.ejor.2017.04.061' class='papercite_doi' title='View document on publisher site'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/external.png' width='10' height='10' alt='[DOI]' \/><\/a>           Luis Gouveia, Markus Leitner, and Mario Ruthmair. Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem. <em>European Journal of Operational Research<\/em>, 262(3):908\u2013928, 2017. <br\/>    <a href=\"javascript:void(0)\" id=\"papercite_1\" class=\"papercite_toggle\">[Bibtex]<\/a>    <div class=\"papercite_bibtex\" id=\"papercite_1_block\"><pre><code class=\"tex bibtex\">@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><\/div>         <\/li>           <\/ul><\/p>\n<p><strong>Generalized Least Cost Influence Problem<\/strong><\/p>\n<p>Benchmark instances can be downloaded <a href=\"http:\/\/mario.ruthmair.at\/wp-content\/uploads\/2020\/04\/socnet-instances-v2.zip\">here<\/a>. For details we refer to<br \/><ul class=\"papercite_bibliography\">       <li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/fischetti2018.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>   <a href='http:\/\/dx.doi.org\/10.1007\/s10107-018-1288-y' class='papercite_doi' title='View document on publisher site'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/external.png' width='10' height='10' alt='[DOI]' \/><\/a>           Matteo Fischetti, Michael Kahr, Markus Leitner, Michele Monaci, and Mario Ruthmair. Least cost influence propagation in (social) networks. <em>Mathematical Programming<\/em>, 170(1):293\u2013325, 2018. <br\/>    <a href=\"javascript:void(0)\" id=\"papercite_2\" class=\"papercite_toggle\">[Bibtex]<\/a>    <div class=\"papercite_bibtex\" id=\"papercite_2_block\"><pre><code class=\"tex bibtex\">@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><\/div>         <\/li>           <\/ul><\/p>\n<p><strong>Traveling Salesman Problem with Drone<\/strong><\/p>\n<p>Benchmark instances (originally created by Stefan Poikonen) can be downloaded <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/uploads\/2021\/02\/tspd-instances.zip\">here<\/a>. Detailed results can be found <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/uploads\/2021\/04\/TSPD_detailed_results.csv\">here<\/a>.<br \/>For details we refer to<br \/><ul class=\"papercite_bibliography\">       <li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/roberti2021.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>   <a href='http:\/\/dx.doi.org\/10.1287\/trsc.2020.1017' class='papercite_doi' title='View document on publisher site'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/external.png' width='10' height='10' alt='[DOI]' \/><\/a>           Roberto Roberti and Mario Ruthmair. Exact Methods for the Traveling Salesman Problem with Drone. <em>Transportation Science<\/em>, 55(2):315\u2013335, 2021. <br\/>    <a href=\"javascript:void(0)\" id=\"papercite_3\" class=\"papercite_toggle\">[Bibtex]<\/a>    <div class=\"papercite_bibtex\" id=\"papercite_3_block\"><pre><code class=\"tex bibtex\">@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><\/div>         <\/li>           <\/ul><\/p>\n<p><strong>Arc routing with electric vehicles<\/strong><\/p>\n<p>Benchmark instances can be downloaded <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/uploads\/2022\/10\/instances.zip\">here<\/a>. For details we refer to<br \/><ul class=\"papercite_bibliography\">       <li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/fernandez2022.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>   <a href='http:\/\/dx.doi.org\/10.1287\/trsc.2022.1126' class='papercite_doi' title='View document on publisher site'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/external.png' width='10' height='10' alt='[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. <em>Transportation Science<\/em>, 56(5):1219-1237, 2022. <br\/>    <a href=\"javascript:void(0)\" id=\"papercite_4\" class=\"papercite_toggle\">[Bibtex]<\/a>    <div class=\"papercite_bibtex\" id=\"papercite_4_block\"><pre><code class=\"tex bibtex\">@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><\/div>         <\/li>           <\/ul><\/p>\n<p><strong>Multi-depot routing with split deliveries<\/strong><\/p>\n<p>Benchmark instances (some are originally created by D. Gulczynski) can be downloaded <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/uploads\/2022\/08\/mdsd-instances.zip\">here<\/a>. For details we refer to<br \/><ul class=\"papercite_bibliography\">       <li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/gouveia2022.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>   <a href='http:\/\/dx.doi.org\/10.1287\/trsc.2022.1179' class='papercite_doi' title='View document on publisher site'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/external.png' width='10' height='10' alt='[DOI]' \/><\/a>           Luis Gouveia, Markus Leitner, and Mario Ruthmair. Multi-depot routing with split deliveries: Models and a branch-and-cut algorithm. <em>Transportation Science<\/em>, 57(2):512-530, 2022. <br\/>    <a href=\"javascript:void(0)\" id=\"papercite_5\" class=\"papercite_toggle\">[Bibtex]<\/a>    <div class=\"papercite_bibtex\" id=\"papercite_5_block\"><pre><code class=\"tex bibtex\">@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><\/div>         <\/li>           <\/ul><\/p>\n<p>Please contact me in case you have questions!<\/p>\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>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\u2013841, 2014. [Bibtex] @Article{Gouveia2014, author = {Gouveia, Luis and Moura, Pedro and Ruthmair, Mario and Sousa, Amaro}, [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":10,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-226","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/pages\/226","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=226"}],"version-history":[{"count":25,"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/pages\/226\/revisions"}],"predecessor-version":[{"id":464,"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/pages\/226\/revisions\/464"}],"wp:attachment":[{"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=226"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}