<?xml version="1.0"?>
<dblpperson name="Aristide Mingozzi" pid="39/682" n="42">
<person key="homepages/39/682" mdate="2009-06-09">
<author pid="39/682">Aristide Mingozzi</author>
</person>
<r><article key="journals/transci/MingozziR18" mdate="2020-09-08">
<author pid="39/682">Aristide Mingozzi</author>
<author orcid="0000-0002-2987-1593" pid="62/10722">Roberto Roberti</author>
<title>An Exact Algorithm for the Fixed Charge Transportation Problem Based on Matching Source and Sink Patterns.</title>
<pages>229-238</pages>
<year>2018</year>
<volume>52</volume>
<journal>Transp. Sci.</journal>
<number>2</number>
<ee>https://doi.org/10.1287/trsc.2017.0742</ee>
<url>db/journals/transci/transci52.html#MingozziR18</url>
</article>
</r>
<r><article key="journals/networks/BartoliniBM16" mdate="2017-05-28">
<author pid="06/5021">Enrico Bartolini</author>
<author pid="77/6205">Lawrence Bodin</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>The traveling salesman problem with pickup, delivery, and ride-time constraints.</title>
<pages>95-110</pages>
<year>2016</year>
<volume>67</volume>
<journal>Networks</journal>
<number>2</number>
<ee>https://doi.org/10.1002/net.21663</ee>
<url>db/journals/networks/networks67.html#BartoliniBM16</url>
</article>
</r>
<r><article key="journals/mansci/RobertiBM15" mdate="2020-06-30">
<author orcid="0000-0002-2987-1593" pid="62/10722">Roberto Roberti</author>
<author pid="06/5021">Enrico Bartolini</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation.</title>
<pages>1275-1291</pages>
<year>2015</year>
<volume>61</volume>
<journal>Manag. Sci.</journal>
<number>6</number>
<ee>https://doi.org/10.1287/mnsc.2014.1947</ee>
<url>db/journals/mansci/mansci61.html#RobertiBM15</url>
</article>
</r>
<r><article key="journals/transci/RobertiM14" mdate="2020-09-08">
<author orcid="0000-0002-2987-1593" pid="62/10722">Roberto Roberti</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>Dynamic ng-Path Relaxation for the Delivery Man Problem.</title>
<pages>413-424</pages>
<year>2014</year>
<volume>48</volume>
<journal>Transp. Sci.</journal>
<number>3</number>
<ee>https://doi.org/10.1287/trsc.2013.0474</ee>
<url>db/journals/transci/transci48.html#RobertiM14</url>
</article>
</r>
<r><article key="journals/informs/MingozziRT13" mdate="2020-03-15">
<author pid="39/682">Aristide Mingozzi</author>
<author orcid="0000-0002-2987-1593" pid="62/10722">Roberto Roberti</author>
<author pid="t/PaoloToth">Paolo Toth</author>
<title>An Exact Algorithm for the Multitrip Vehicle Routing Problem.</title>
<pages>193-207</pages>
<year>2013</year>
<volume>25</volume>
<journal>INFORMS J. Comput.</journal>
<number>2</number>
<ee>https://doi.org/10.1287/ijoc.1110.0495</ee>
<url>db/journals/informs/informs25.html#MingozziRT13</url>
</article>
</r>
<r><article key="journals/ior/BaldacciMRC13" mdate="2020-03-31">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="39/682">Aristide Mingozzi</author>
<author orcid="0000-0002-2987-1593" pid="62/10722">Roberto Roberti</author>
<author orcid="0000-0002-5459-5797" pid="33/1333">Roberto Wolfler Calvo</author>
<title>An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem.</title>
<pages>298-314</pages>
<year>2013</year>
<volume>61</volume>
<journal>Oper. Res.</journal>
<number>2</number>
<ee>https://doi.org/10.1287/opre.1120.1153</ee>
<url>db/journals/ior/ior61.html#BaldacciMRC13</url>
</article>
</r>
<r><article key="journals/eor/BaldacciMR12" mdate="2020-02-21">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="39/682">Aristide Mingozzi</author>
<author orcid="0000-0002-2987-1593" pid="62/10722">Roberto Roberti</author>
<title>Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints.</title>
<pages>1-6</pages>
<year>2012</year>
<volume>218</volume>
<journal>Eur. J. Oper. Res.</journal>
<number>1</number>
<ee>https://doi.org/10.1016/j.ejor.2011.07.037</ee>
<url>db/journals/eor/eor218.html#BaldacciMR12</url>
</article>
</r>
<r><article key="journals/informs/BaldacciMR12" mdate="2020-03-15">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="39/682">Aristide Mingozzi</author>
<author orcid="0000-0002-2987-1593" pid="62/10722">Roberto Roberti</author>
<title>New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows.</title>
<pages>356-371</pages>
<year>2012</year>
<volume>24</volume>
<journal>INFORMS J. Comput.</journal>
<number>3</number>
<ee>https://doi.org/10.1287/ijoc.1110.0456</ee>
<url>db/journals/informs/informs24.html#BaldacciMR12</url>
</article>
</r>
<r><article key="journals/ior/BaldacciBMV11" mdate="2020-03-31">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="06/5021">Enrico Bartolini</author>
<author pid="39/682">Aristide Mingozzi</author>
<author pid="94/5015">Andrea Valletta</author>
<title>An Exact Algorithm for the Period Routing Problem.</title>
<pages>228-241</pages>
<year>2011</year>
<volume>59</volume>
<journal>Oper. Res.</journal>
<number>1</number>
<ee>https://doi.org/10.1287/opre.1100.0875</ee>
<url>db/journals/ior/ior59.html#BaldacciBMV11</url>
</article>
</r>
<r><article key="journals/ior/BaldacciBM11" mdate="2020-03-31">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="06/5021">Enrico Bartolini</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>An Exact Algorithm for the Pickup and Delivery Problem with Time Windows.</title>
<pages>414-426</pages>
<year>2011</year>
<volume>59</volume>
<journal>Oper. Res.</journal>
<number>2</number>
<ee>https://doi.org/10.1287/opre.1100.0881</ee>
<url>db/journals/ior/ior59.html#BaldacciBM11</url>
</article>
</r>
<r><article key="journals/ior/BaldacciMR11" mdate="2020-03-31">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="39/682">Aristide Mingozzi</author>
<author orcid="0000-0002-2987-1593" pid="62/10722">Roberto Roberti</author>
<title>New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem.</title>
<pages>1269-1283</pages>
<year>2011</year>
<volume>59</volume>
<journal>Oper. Res.</journal>
<number>5</number>
<ee>https://doi.org/10.1287/opre.1110.0975</ee>
<url>db/journals/ior/ior59.html#BaldacciMR11</url>
</article>
</r>
<r><article key="journals/ior/BaldacciMC11" mdate="2020-03-31">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="39/682">Aristide Mingozzi</author>
<author orcid="0000-0002-5459-5797" pid="33/1333">Roberto Wolfler Calvo</author>
<title>An Exact Method for the Capacitated Location-Routing Problem.</title>
<pages>1284-1296</pages>
<year>2011</year>
<volume>59</volume>
<journal>Oper. Res.</journal>
<number>5</number>
<ee>https://doi.org/10.1287/opre.1110.0989</ee>
<url>db/journals/ior/ior59.html#BaldacciMC11</url>
</article>
</r>
<r><article key="journals/cms/BaldacciBMR10" mdate="2020-05-10">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="06/5021">Enrico Bartolini</author>
<author pid="39/682">Aristide Mingozzi</author>
<author orcid="0000-0002-2987-1593" pid="62/10722">Roberto Roberti</author>
<title>An exact solution framework for a broad class of vehicle routing problems.</title>
<pages>229-268</pages>
<year>2010</year>
<volume>7</volume>
<journal>Comput. Manag. Sci.</journal>
<number>3</number>
<ee>https://doi.org/10.1007/s10287-009-0118-3</ee>
<url>db/journals/cms/cms7.html#BaldacciBMR10</url>
</article>
</r>
<r><article key="journals/heuristics/BartoliniM09" mdate="2017-05-18">
<author pid="06/5021">Enrico Bartolini</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>Algorithms for the non-bifurcated network design problem.</title>
<pages>259-281</pages>
<year>2009</year>
<volume>15</volume>
<journal>J. Heuristics</journal>
<number>3</number>
<ee>https://doi.org/10.1007/s10732-008-9091-1</ee>
<url>db/journals/heuristics/heuristics15.html#BartoliniM09</url>
</article>
</r>
<r><article key="journals/mp/BaldacciM09" mdate="2017-06-08">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>A unified exact method for solving different classes of vehicle routing problems.</title>
<pages>347-380</pages>
<year>2009</year>
<volume>120</volume>
<journal>Math. Program.</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s10107-008-0218-9</ee>
<url>db/journals/mp/mp120.html#BaldacciM09</url>
</article>
</r>
<r><article key="journals/disopt/BoschettiMR08" mdate="2021-02-12">
<author orcid="0000-0002-8712-115X" pid="38/538">Marco A. Boschetti</author>
<author pid="39/682">Aristide Mingozzi</author>
<author pid="94/3612">Salvatore Ricciardelli</author>
<title>A dual ascent procedure for the set partitioning problem.</title>
<pages>735-747</pages>
<year>2008</year>
<volume>5</volume>
<journal>Discret. Optim.</journal>
<number>4</number>
<ee type="oa">https://doi.org/10.1016/j.disopt.2008.06.001</ee>
<url>db/journals/disopt/disopt5.html#BoschettiMR08</url>
</article>
</r>
<r><article key="journals/mp/BaldacciCM08" mdate="2017-06-08">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="93/5885">Nicos Christofides</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts.</title>
<pages>351-385</pages>
<year>2008</year>
<volume>115</volume>
<journal>Math. Program.</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s10107-007-0178-5</ee>
<url>db/journals/mp/mp115.html#BaldacciCM08</url>
</article>
</r>
<r><article key="journals/networks/VigoTM07" mdate="2017-06-08">
<author orcid="0000-0002-1499-8452" pid="43/5242">Daniele Vigo</author>
<author pid="t/PaoloToth">Paolo Toth</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>Route 2005: Recent advances in vehicle routing optimization.</title>
<pages>243-244</pages>
<year>2007</year>
<volume>49</volume>
<journal>Networks</journal>
<number>4</number>
<ee>https://doi.org/10.1002/net.20175</ee>
<url>db/journals/networks/networks49.html#VigoTM07</url>
</article>
</r>
<r><inproceedings key="conf/lion/BartoliniMM07" mdate="2019-06-02">
<author pid="06/5021">Enrico Bartolini</author>
<author orcid="0000-0002-1220-1235" pid="36/4608">Vittorio Maniezzo</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>An Adaptive Memory-Based Approach Based on Partial Enumeration.</title>
<pages>12-24</pages>
<year>2007</year>
<booktitle>LION</booktitle>
<ee>https://doi.org/10.1007/978-3-540-92695-5_2</ee>
<ee>https://www.wikidata.org/entity/Q59195735</ee>
<crossref>conf/lion/2007</crossref>
<url>db/conf/lion/lion2007.html#BartoliniMM07</url>
</inproceedings>
</r>
<r><article key="journals/cor/BaldacciBM06" mdate="2020-02-18">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="77/6205">Lawrence Bodin</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem.</title>
<pages>2667-2702</pages>
<year>2006</year>
<volume>33</volume>
<journal>Comput. Oper. Res.</journal>
<ee>https://doi.org/10.1016/j.cor.2005.02.023</ee>
<url>db/journals/cor/cor33.html#BaldacciBM06</url>
</article>
</r>
<r><inproceedings key="conf/sara/Mingozzi05" mdate="2017-05-23">
<author pid="39/682">Aristide Mingozzi</author>
<title>The Multi-depot Periodic Vehicle Routing Problem.</title>
<pages>347-350</pages>
<year>2005</year>
<crossref>conf/sara/2005</crossref>
<booktitle>SARA</booktitle>
<ee>https://doi.org/10.1007/11527862_27</ee>
<url>db/conf/sara/sara2005.html#Mingozzi05</url>
</inproceedings>
</r>
<r><article key="journals/anor/BoschettiMR04" mdate="2020-08-13">
<author orcid="0000-0002-8712-115X" pid="38/538">Marco A. Boschetti</author>
<author pid="39/682">Aristide Mingozzi</author>
<author pid="94/3612">Salvatore Ricciardelli</author>
<title>An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem.</title>
<pages>177-201</pages>
<year>2004</year>
<volume>127</volume>
<journal>Ann. Oper. Res.</journal>
<number>1-4</number>
<ee>https://doi.org/10.1023/B:ANOR.0000019089.86834.91</ee>
<url>db/journals/anor/anor127.html#BoschettiMR04</url>
</article>
</r>
<r><article key="journals/ior/BaldacciMM04" mdate="2020-03-31">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author orcid="0000-0002-1220-1235" pid="36/4608">Vittorio Maniezzo</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation.</title>
<pages>422-439</pages>
<year>2004</year>
<volume>52</volume>
<journal>Oper. Res.</journal>
<number>3</number>
<ee>https://doi.org/10.1287/opre.1030.0106</ee>
<ee>https://www.wikidata.org/entity/Q59195753</ee>
<url>db/journals/ior/ior52.html#BaldacciMM04</url>
</article>
</r>
<r><article key="journals/ior/BaldacciHM04" mdate="2024-05-07">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="51/3082">Eleni Hadjiconstantinou</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation.</title>
<pages>723-738</pages>
<year>2004</year>
<volume>52</volume>
<journal>Oper. Res.</journal>
<number>5</number>
<ee>https://doi.org/10.1287/opre.1040.0111</ee>
<url>db/journals/ior/ior52.html#BaldacciHM04</url>
</article>
</r>
<r><article key="journals/4or/BoschettiM03" mdate="2017-06-05">
<author orcid="0000-0002-8712-115X" pid="38/538">Marco A. Boschetti</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case.</title>
<pages>27-42</pages>
<year>2003</year>
<volume>1</volume>
<journal>4OR</journal>
<number>1</number>
<ee>https://doi.org/10.1007/s10288-002-0005-z</ee>
<url>db/journals/4or/4or1.html#BoschettiM03</url>
</article>
</r>
<r><article key="journals/4or/BoschettiM03a" mdate="2017-06-05">
<author orcid="0000-0002-8712-115X" pid="38/538">Marco A. Boschetti</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds.</title>
<pages>135-147</pages>
<year>2003</year>
<volume>1</volume>
<journal>4OR</journal>
<number>2</number>
<ee>https://doi.org/10.1007/s10288-002-0006-y</ee>
<url>db/journals/4or/4or1.html#BoschettiM03a</url>
</article>
</r>
<r><article key="journals/networks/BaldacciHM03" mdate="2017-06-08">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="51/3082">Eleni Hadjiconstantinou</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections.</title>
<pages>26-41</pages>
<year>2003</year>
<volume>42</volume>
<journal>Networks</journal>
<number>1</number>
<ee>https://doi.org/10.1002/net.10079</ee>
<url>db/journals/networks/networks42.html#BaldacciHM03</url>
</article>
</r>
<r><article key="journals/cor/BaldacciHMM02" mdate="2020-02-18">
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="51/3082">Eleni Hadjiconstantinou</author>
<author orcid="0000-0002-1220-1235" pid="36/4608">Vittorio Maniezzo</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>A new method for solving capacitated location problems based on a set partitioning approach.</title>
<pages>365-386</pages>
<year>2002</year>
<volume>29</volume>
<journal>Comput. Oper. Res.</journal>
<number>4</number>
<ee>https://doi.org/10.1016/S0305-0548(00)00072-1</ee>
<ee>https://www.wikidata.org/entity/Q59195757</ee>
<url>db/journals/cor/cor29.html#BaldacciHMM02</url>
</article>
</r>
<r><article key="journals/dam/MingozziM02" mdate="2021-02-11">
<author pid="39/682">Aristide Mingozzi</author>
<author pid="70/4857">Serena Morigi</author>
<title>Partitioning a matrix with non-guillotine cuts to minimize the maximum cos.</title>
<pages>243-260</pages>
<year>2002</year>
<volume>116</volume>
<journal>Discret. Appl. Math.</journal>
<number>3</number>
<url>db/journals/dam/dam116.html#MingozziM02</url>
<ee type="oa">https://doi.org/10.1016/S0166-218X(00)00286-9</ee>
</article>
</r>
<r><inproceedings key="conf/sara/Mingozzi02" mdate="2017-05-23">
<author pid="39/682">Aristide Mingozzi</author>
<title>State Space Relaxation and Search Strategies in Dynamic Programming.</title>
<pages>51</pages>
<year>2002</year>
<crossref>conf/sara/2002</crossref>
<booktitle>SARA</booktitle>
<ee>https://doi.org/10.1007/3-540-45622-8_4</ee>
<url>db/conf/sara/sara2002.html#Mingozzi02</url>
</inproceedings>
</r>
<r><article key="journals/transci/BodinMBB00" mdate="2025-04-01">
<author pid="77/6205">Lawrence Bodin</author>
<author pid="39/682">Aristide Mingozzi</author>
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<author pid="b/MichaelOBall">Michael O. Ball</author>
<title>The Rollon-Rolloff Vehicle Routing Problem.</title>
<pages>271-288</pages>
<year>2000</year>
<volume>34</volume>
<journal>Transp. Sci.</journal>
<number>3</number>
<ee>https://doi.org/10.1287/trsc.34.3.271.12301</ee>
<url>db/journals/transci/transci34.html#BodinMBB00</url>
</article>
</r>
<r><article key="journals/ior/MingozziBRB99" mdate="2020-03-31">
<author pid="39/682">Aristide Mingozzi</author>
<author orcid="0000-0002-8712-115X" pid="38/538">Marco A. Boschetti</author>
<author pid="94/3612">Salvatore Ricciardelli</author>
<author pid="98/4520">Lucio Bianco</author>
<title>A Set Partitioning Approach to the Crew Scheduling Problem.</title>
<pages>873-888</pages>
<year>1999</year>
<volume>47</volume>
<journal>Oper. Res.</journal>
<number>6</number>
<ee>https://doi.org/10.1287/opre.47.6.873</ee>
<url>db/journals/ior/ior47.html#MingozziBRB99</url>
</article>
</r>
<r><article key="journals/orl/ManiezzoM99" mdate="2019-06-02">
<author orcid="0000-0002-1220-1235" pid="36/4608">Vittorio Maniezzo</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>The project scheduling problem with irregular starting time costs.</title>
<pages>175-182</pages>
<year>1999</year>
<volume>25</volume>
<journal>Oper. Res. Lett.</journal>
<number>4</number>
<ee>https://doi.org/10.1016/S0167-6377(99)00050-4</ee>
<ee>https://www.wikidata.org/entity/Q59195766</ee>
<url>db/journals/orl/orl25.html#ManiezzoM99</url>
</article>
</r>
<r><article key="journals/transci/MingozziGB99" mdate="2025-04-01">
<author pid="39/682">Aristide Mingozzi</author>
<author pid="90/7302">Simone Giorgi</author>
<author orcid="0000-0003-0938-5798" pid="75/579">Roberto Baldacci</author>
<title>An Exact Method for the Vehicle Routing Problem with Backhauls.</title>
<pages>315-329</pages>
<year>1999</year>
<volume>33</volume>
<journal>Transp. Sci.</journal>
<number>3</number>
<ee>https://doi.org/10.1287/trsc.33.3.315</ee>
<url>db/journals/transci/transci33.html#MingozziGB99</url>
</article>
</r>
<r><article key="journals/heuristics/ManiezzoMB98" mdate="2017-05-18">
<author pid="36/4608">Vittorio Maniezzo</author>
<author pid="39/682">Aristide Mingozzi</author>
<author pid="75/579">Roberto Baldacci</author>
<title>A Bionomic Approach to the Capacitated p-Median Problem.</title>
<pages>263-280</pages>
<year>1998</year>
<volume>4</volume>
<journal>J. Heuristics</journal>
<number>3</number>
<url>db/journals/heuristics/heuristics4.html#ManiezzoMB98</url>
<ee>https://doi.org/10.1023/A:1009665717611</ee>
</article>
</r>
<r><article key="journals/ior/MingozziBR97" mdate="2020-03-31">
<author pid="39/682">Aristide Mingozzi</author>
<author pid="98/4520">Lucio Bianco</author>
<author pid="94/3612">Salvatore Ricciardelli</author>
<title>Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints.</title>
<pages>365-377</pages>
<year>1997</year>
<volume>45</volume>
<journal>Oper. Res.</journal>
<number>3</number>
<ee>https://doi.org/10.1287/opre.45.3.365</ee>
<url>db/journals/ior/ior45.html#MingozziBR97</url>
</article>
</r>
<r><article key="journals/anor/Hadjiconstantinou95" mdate="2020-08-13">
<author pid="51/3082">Eleni Hadjiconstantinou</author>
<author pid="93/5885">Nicos Christofides</author>
<author pid="39/682">Aristide Mingozzi</author>
<title>A new exact algorithm for the vehicle routing problem based on<i>q</i>-paths and<i>k</i>-shortest paths relaxations.</title>
<pages>21-43</pages>
<year>1995</year>
<volume>61</volume>
<journal>Ann. Oper. Res.</journal>
<number>1</number>
<ee>https://doi.org/10.1007/BF02098280</ee>
<url>db/journals/anor/anor61.html#Hadjiconstantinou95</url>
</article>
</r>
<r><article key="journals/dam/MingozziRS95" mdate="2021-02-11">
<author pid="39/682">Aristide Mingozzi</author>
<author pid="94/3612">Salvatore Ricciardelli</author>
<author pid="85/4662">Massimo Spadoni</author>
<title>Partitioning a Matrix to Minimize the Maximum Cost.</title>
<pages>221-248</pages>
<year>1995</year>
<volume>62</volume>
<journal>Discret. Appl. Math.</journal>
<number>1-3</number>
<ee type="oa">https://doi.org/10.1016/0166-218X(94)00154-6</ee>
<url>db/journals/dam/dam62.html#MingozziRS95</url>
</article>
</r>
<r><article key="journals/networks/BiancoMR93" mdate="2017-05-28">
<author pid="98/4520">Lucio Bianco</author>
<author pid="39/682">Aristide Mingozzi</author>
<author pid="94/3612">Salvatore Ricciardelli</author>
<title>The traveling salesman problem with cumulative costs.</title>
<pages>81-91</pages>
<year>1993</year>
<volume>23</volume>
<journal>Networks</journal>
<number>2</number>
<ee>https://doi.org/10.1002/net.3230230202</ee>
<url>db/journals/networks/networks23.html#BiancoMR93</url>
</article>
</r>
<r><article key="journals/mp/ChristofidesMT81" mdate="2017-05-27">
<author pid="93/5885">Nicos Christofides</author>
<author pid="39/682">Aristide Mingozzi</author>
<author pid="t/PaoloToth">Paolo Toth</author>
<title>Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations.</title>
<pages>255-282</pages>
<year>1981</year>
<volume>20</volume>
<journal>Math. Program.</journal>
<number>1</number>
<ee>https://doi.org/10.1007/BF01589353</ee>
<url>db/journals/mp/mp20.html#ChristofidesMT81</url>
</article>
</r>
<r><article key="journals/networks/ChristofidesMT81" mdate="2017-05-28">
<author pid="93/5885">Nicos Christofides</author>
<author pid="39/682">Aristide Mingozzi</author>
<author pid="t/PaoloToth">Paolo Toth</author>
<title>State-space relaxation procedures for the computation of bounds to routing problems.</title>
<pages>145-164</pages>
<year>1981</year>
<volume>11</volume>
<journal>Networks</journal>
<number>2</number>
<ee>https://doi.org/10.1002/net.3230110207</ee>
<url>db/journals/networks/networks11.html#ChristofidesMT81</url>
</article>
</r>
<r><article key="journals/ior/ChristofidesMT80" mdate="2020-03-31">
<author pid="93/5885">Nicos Christofides</author>
<author pid="39/682">Aristide Mingozzi</author>
<author pid="t/PaoloToth">Paolo Toth</author>
<title>Dynamic Loading and Unloading of Liquids into Tanks.</title>
<pages>633-649</pages>
<year>1980</year>
<volume>28</volume>
<journal>Oper. Res.</journal>
<number>3-Part-II</number>
<ee>https://doi.org/10.1287/opre.28.3.633</ee>
<url>db/journals/ior/ior28.html#ChristofidesMT80</url>
</article>
</r>
<coauthors n="18" nc="1">
<co c="0"><na f="b/Baldacci:Roberto" pid="75/579">Roberto Baldacci</na></co>
<co c="0"><na f="b/Ball:Michael_O=" pid="b/MichaelOBall">Michael O. Ball</na></co>
<co c="0"><na f="b/Bartolini:Enrico" pid="06/5021">Enrico Bartolini</na></co>
<co c="0"><na f="b/Bianco:Lucio" pid="98/4520">Lucio Bianco</na></co>
<co c="0"><na f="b/Bodin:Lawrence" pid="77/6205">Lawrence Bodin</na></co>
<co c="0" n="2"><na f="b/Boschetti:Marco_Antonio" pid="38/538">Marco Antonio Boschetti</na><na>Marco A. Boschetti</na></co>
<co c="0"><na f="c/Calvo:Roberto_Wolfler" pid="33/1333">Roberto Wolfler Calvo</na></co>
<co c="0"><na f="c/Christofides:Nicos" pid="93/5885">Nicos Christofides</na></co>
<co c="0"><na f="g/Giorgi:Simone" pid="90/7302">Simone Giorgi</na></co>
<co c="0"><na f="h/Hadjiconstantinou:Eleni" pid="51/3082">Eleni Hadjiconstantinou</na></co>
<co c="0"><na f="m/Maniezzo:Vittorio" pid="36/4608">Vittorio Maniezzo</na></co>
<co c="-1"><na f="m/Morigi:Serena" pid="70/4857">Serena Morigi</na></co>
<co c="0"><na f="r/Ricciardelli:Salvatore" pid="94/3612">Salvatore Ricciardelli</na></co>
<co c="0"><na f="r/Roberti:Roberto" pid="62/10722">Roberto Roberti</na></co>
<co c="0"><na f="s/Spadoni:Massimo" pid="85/4662">Massimo Spadoni</na></co>
<co c="0"><na f="t/Toth:Paolo" pid="t/PaoloToth">Paolo Toth</na></co>
<co c="0"><na f="v/Valletta:Andrea" pid="94/5015">Andrea Valletta</na></co>
<co c="0"><na f="v/Vigo:Daniele" pid="43/5242">Daniele Vigo</na></co>
</coauthors>
</dblpperson>

