{"id":"https://openalex.org/W2148742122","doi":"https://doi.org/10.1002/net.3230230202","title":"The traveling salesman problem with cumulative costs","display_name":"The traveling salesman problem with cumulative costs","publication_year":1993,"publication_date":"1993-03-01","ids":{"openalex":"https://openalex.org/W2148742122","doi":"https://doi.org/10.1002/net.3230230202","mag":"2148742122"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230230202","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230230202","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/A5110744310","display_name":"Lucio Bianco","orcid":null},"institutions":[{"id":"https://openalex.org/I4210162062","display_name":"Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti","ror":"https://ror.org/054ye0e45","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210155236","https://openalex.org/I4210162062"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Lucio Bianco","raw_affiliation_strings":["Istituto di Analisi dei Sistemi ed Informatica del CNR, Viale Manzoni 30, 00185 Roma, Dipartimento di Ingegneria Elettronica, Universita\u0300 di Roma \u201cTor Vergata,\u201d Rome, Italy","Istituto di Analisi dei Sistemi ed Informatica del CNR, Viale Manzoni 30, 00185 Roma, Dipartimento di Ingegneria Elettronica, Universit\u00e0 di Roma \"Tor Vergata,\" Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Istituto di Analisi dei Sistemi ed Informatica del CNR, Viale Manzoni 30, 00185 Roma, Dipartimento di Ingegneria Elettronica, Universita\u0300 di Roma \u201cTor Vergata,\u201d Rome, Italy","institution_ids":["https://openalex.org/I4210162062"]},{"raw_affiliation_string":"Istituto di Analisi dei Sistemi ed Informatica del CNR, Viale Manzoni 30, 00185 Roma, Dipartimento di Ingegneria Elettronica, Universit\u00e0 di Roma \"Tor Vergata,\" Rome, Italy","institution_ids":["https://openalex.org/I4210162062"]}]},{"author_position":"middle","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":"Aristide Mingozzi","raw_affiliation_strings":["Dipartimento di Matematica, Universita\u0300 di Bologna, Bologna, Italy","Dipartimento di Matematica, Universit\u00e0 di Bologna, Bologna, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universita\u0300 di Bologna, Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 di Bologna, Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078375909","display_name":"Salvatore Ricciardelli","orcid":null},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Salvatore Ricciardelli","raw_affiliation_strings":["Dipartimento di Ingegneria Elettronica, Universita\u0300 di Roma \u201cTor Vergata,\u201d Rome, Italy","Dipartimento di Ingegneria Elettronica, Universit\u00e0 di Roma \"Tor Vergata,\" Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria Elettronica, Universita\u0300 di Roma \u201cTor Vergata,\u201d Rome, Italy","institution_ids":["https://openalex.org/I116067653"]},{"raw_affiliation_string":"Dipartimento di Ingegneria Elettronica, Universit\u00e0 di Roma \"Tor Vergata,\" Rome, Italy","institution_ids":["https://openalex.org/I116067653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":5.73,"has_fulltext":false,"cited_by_count":103,"citation_normalized_percentile":{"value":0.9591366,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"23","issue":"2","first_page":"81","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T11502","display_name":"Facility Location and Emergency Management","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8915154933929443},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7251684069633484},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.702222466468811},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6070354580879211},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5776116847991943},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5202799439430237},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4425823986530304},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4281316101551056},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3980766534805298},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.3871835768222809},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.32186535000801086}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8915154933929443},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7251684069633484},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.702222466468811},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6070354580879211},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5776116847991943},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5202799439430237},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4425823986530304},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4281316101551056},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3980766534805298},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.3871835768222809},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.32186535000801086},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.3230230202","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230230202","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:art.torvergata.it:2108/52339","is_oa":false,"landing_page_url":"http://hdl.handle.net/2108/52339","pdf_url":null,"source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"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":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1965997503","https://openalex.org/W1969186119","https://openalex.org/W2012251361","https://openalex.org/W2053913299","https://openalex.org/W2056425817","https://openalex.org/W2072136110","https://openalex.org/W2107612355","https://openalex.org/W2163873159","https://openalex.org/W4248362584"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W4389782626","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2359992618","https://openalex.org/W2265604726","https://openalex.org/W2171568915","https://openalex.org/W2033053473","https://openalex.org/W2044119054","https://openalex.org/W2105006450"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"paper,":[3],"we":[4],"consider":[5],"a":[6,42,53,76],"special":[7],"case":[8],"of":[9,23,45,69,78],"the":[10,16,21,28,46,65,70],"time\u2010dependent":[11],"traveling":[12],"salesman":[13],"problem":[14],"where":[15],"objective":[17],"is":[18,61],"to":[19,30,63,83,93,103],"minimize":[20],"sum":[22],"all":[24,31],"distances":[25],"traveled":[26],"from":[27,57,67,81,111],"origin":[29],"other":[32],"cities.":[33],"Two":[34],"exact":[35],"algorithms,":[36],"incorporating":[37],"lower":[38],"bounds":[39],"provided":[40],"by":[41,115],"Lagrangean":[43],"relaxation":[44],"problem,":[47],"are":[48,86],"presented.":[49],"We":[50],"also":[51],"investigate":[52],"heuristic":[54],"procedure":[55],"derived":[56],"dynamic":[58],"programming":[59],"that":[60,90],"able":[62],"evaluate":[64],"distance":[66],"optimality":[68],"produced":[71],"solution.":[72],"Computational":[73],"results":[74],"for":[75],"number":[77],"problems":[79,91,101],"ranging":[80],"15":[82],"60":[84,104],"cities":[85,95,105],"given.":[87],"They":[88],"show":[89],"up":[92,102],"35":[94],"can":[96,106],"be":[97,107],"solved":[98,108],"exactly":[99],"and":[100],"within":[109],"3%":[110],"optimality.":[112],"\u00a9":[113],"1993":[114],"John":[116],"Wiley":[117],"&":[118],"Sons,":[119],"Inc.":[120]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2025-10-10T00:00:00"}