{"id":"https://openalex.org/W2105006450","doi":"https://doi.org/10.1002/net.10079","title":"An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections","display_name":"An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections","publication_year":2003,"publication_date":"2003-06-03","ids":{"openalex":"https://openalex.org/W2105006450","doi":"https://doi.org/10.1002/net.10079","mag":"2105006450"},"language":"en","primary_location":{"id":"doi:10.1002/net.10079","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.10079","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016325556","display_name":"Roberto Baldacci","orcid":"https://orcid.org/0000-0003-0938-5798"},"institutions":[{"id":"https://openalex.org/I122346577","display_name":"University of Modena and Reggio Emilia","ror":"https://ror.org/02d4c4y02","country_code":"IT","type":"education","lineage":["https://openalex.org/I122346577"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"R. Baldacci","raw_affiliation_strings":["DISMI, University of Modena and Reggio E., V.le Allegri 15, 42100 Reggio E., Italy"],"affiliations":[{"raw_affiliation_string":"DISMI, University of Modena and Reggio E., V.le Allegri 15, 42100 Reggio E., Italy","institution_ids":["https://openalex.org/I122346577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067720204","display_name":"Eleni Hadjiconstantinou","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"E. Hadjiconstantinou","raw_affiliation_strings":["Imperial College, Management School, Exhibition Road, London SW7 2PG, United Kingdom","Imperial College, Management School, Exhibition Road, London SW7 2PG, United Kingdom#TAB#"],"affiliations":[{"raw_affiliation_string":"Imperial College, Management School, Exhibition Road, London SW7 2PG, United Kingdom","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Imperial College, Management School, Exhibition Road, London SW7 2PG, United Kingdom#TAB#","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047471933","display_name":"Aristide Mingozzi","orcid":null},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"A. Mingozzi","raw_affiliation_strings":["Department of Mathematics, University of Bologna, Via Sacchi 3, 47023 Cesena, Italy","Department of Mathematics, University of Bologna via Sacchi, 3, 47023 Cesena, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Bologna, Via Sacchi 3, 47023 Cesena, Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"Department of Mathematics, University of Bologna via Sacchi, 3, 47023 Cesena, Italy","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016325556"],"corresponding_institution_ids":["https://openalex.org/I122346577"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":5.3646,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.9513268,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"42","issue":"1","first_page":"26","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9348657131195068},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.7787194848060608},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.7034050226211548},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.695754885673523},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6693732738494873},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.605215847492218},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5916115045547485},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5746181011199951},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5631609559059143},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5576928853988647},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5036153197288513},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4976949989795685},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4731253981590271},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4671128988265991},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.45062756538391113},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43616044521331787},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.41751497983932495},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3966388404369354}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9348657131195068},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7787194848060608},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.7034050226211548},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.695754885673523},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6693732738494873},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.605215847492218},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5916115045547485},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5746181011199951},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5631609559059143},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5576928853988647},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5036153197288513},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4976949989795685},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4731253981590271},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4671128988265991},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.45062756538391113},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43616044521331787},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.41751497983932495},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3966388404369354},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.10079","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.10079","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:cris.unibo.it:11585/1006609","is_oa":false,"landing_page_url":"https://hdl.handle.net/11585/1006609","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W145326871","https://openalex.org/W1501435780","https://openalex.org/W1991798215","https://openalex.org/W1999750851","https://openalex.org/W2005944337","https://openalex.org/W2011039300","https://openalex.org/W2032686693","https://openalex.org/W2040886899","https://openalex.org/W2115049345","https://openalex.org/W2125375576","https://openalex.org/W2159203019","https://openalex.org/W2571802679","https://openalex.org/W4251394903","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2362402143","https://openalex.org/W1984036937","https://openalex.org/W2125126715","https://openalex.org/W2155694204","https://openalex.org/W4365506312"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"paper,":[3],"we":[4],"describe":[5],"a":[6,24,50,60],"new":[7,31,43],"integer":[8],"programming":[9],"formulation":[10,44],"for":[11,63],"the":[12,38,42,64,68,80,83,86],"Traveling":[13],"Salesman":[14],"Problem":[15],"with":[16],"mixed":[17],"Deliveries":[18],"and":[19],"Collections":[20],"(TSPDC)":[21],"based":[22],"on":[23,72],"two\u2010commodity":[25],"network":[26],"flow":[27],"approach.":[28],"We":[29],"present":[30],"lower":[32,55],"bounds":[33,56],"that":[34],"are":[35,57],"derived":[36],"from":[37,79],"linear":[39],"relaxation":[40],"of":[41,67,75,85],"by":[45],"adding":[46],"valid":[47],"inequalities,":[48],"in":[49,59],"cutting\u2010plane":[51],"fashion.":[52],"The":[53],"resulting":[54],"embedded":[58],"branch\u2010and\u2010cut":[61],"algorithm":[62],"optimal":[65],"solution":[66],"TSPDC.":[69],"Computational":[70],"results":[71],"different":[73],"classes":[74],"test":[76],"problems":[77],"taken":[78],"literature":[81],"indicate":[82],"effectiveness":[84],"proposed":[87],"method.":[88],"\u00a9":[89],"2003":[90],"Wiley":[91],"Periodicals,":[92],"Inc.":[93]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}