{"id":"https://openalex.org/W2163873159","doi":"https://doi.org/10.1002/net.3230110207","title":"State\u2010space relaxation procedures for the computation of bounds to routing problems","display_name":"State\u2010space relaxation procedures for the computation of bounds to routing problems","publication_year":1981,"publication_date":"1981-06-01","ids":{"openalex":"https://openalex.org/W2163873159","doi":"https://doi.org/10.1002/net.3230110207","mag":"2163873159"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230110207","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230110207","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/A5111519836","display_name":"Nicos Christofides","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":"Nicos Christofides","raw_affiliation_strings":["Imperial College, London SW7, 2BX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Imperial College, London SW7, 2BX","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047471933","display_name":"Aristide Mingozzi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210103515","display_name":"Sogesca (Italy)","ror":"https://ror.org/01fnv4f45","country_code":"IT","type":"company","lineage":["https://openalex.org/I4210103515"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"A. Mingozzi","raw_affiliation_strings":["Sogesta, Urbino, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sogesta, Urbino, Italy","institution_ids":["https://openalex.org/I4210103515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084320669","display_name":"Paolo Toth","orcid":"https://orcid.org/0000-0001-6846-5814"},"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":"P. Toth","raw_affiliation_strings":["University of Bologna, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":14.0763,"has_fulltext":false,"cited_by_count":323,"citation_normalized_percentile":{"value":0.98881119,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"11","issue":"2","first_page":"145","last_page":"164"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"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.9986000061035156,"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.9970999956130981,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.7759754061698914},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6718093752861023},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6208934783935547},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6192091107368469},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.5465635061264038},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5457597970962524},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5392587780952454},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5164356827735901},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.5100153684616089},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5020792484283447},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4753938913345337},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4589672088623047},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4507456421852112},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4349942207336426},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4195478558540344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23545706272125244}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.7759754061698914},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6718093752861023},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6208934783935547},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6192091107368469},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.5465635061264038},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5457597970962524},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5392587780952454},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5164356827735901},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.5100153684616089},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5020792484283447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4753938913345337},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4589672088623047},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4507456421852112},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4349942207336426},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4195478558540344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23545706272125244},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230110207","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230110207","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1966807936","https://openalex.org/W2009803313","https://openalex.org/W2015114013","https://openalex.org/W2017697298","https://openalex.org/W2035231387","https://openalex.org/W2149148771","https://openalex.org/W4242130683","https://openalex.org/W4247480955","https://openalex.org/W4249345565","https://openalex.org/W4300129394"],"related_works":["https://openalex.org/W2037613239","https://openalex.org/W3183857959","https://openalex.org/W4243844638","https://openalex.org/W3032916910","https://openalex.org/W2894990380","https://openalex.org/W195910675","https://openalex.org/W2363143319","https://openalex.org/W2351035339","https://openalex.org/W1980006501","https://openalex.org/W2012703063"],"abstract_inverted_index":{"Abstract":[0],"It":[1],"is":[2,27,34,49,86],"well\u2010known":[3],"that":[4,55],"few":[5],"combinatorial":[6],"optimization":[7,141],"problems":[8,131],"can":[9,165],"be":[10,67,166],"solved":[11],"effectively":[12],"by":[13],"dynamic":[14,46],"programming":[15,47],"alone,":[16],"since":[17],"the":[18,23,40,56,59,76,79,109,114,118,152,159],"number":[19],"of":[20,22,78,99,150,158],"vertices":[21],"state":[24,82,124],"space":[25,83,125,144],"graph":[26],"enormous.":[28],"What":[29],"we":[30],"are":[31,127,135,146],"proposing":[32],"here":[33],"a":[35,44,53,63,97],"general":[36,70],"relaxation":[37,84,90],"procedure":[38],"whereby":[39],"state\u2010space":[41],"associated":[42],"with":[43],"given":[45],"recursion":[48,61],"relaxed":[50,60],"in":[51,69,91,137,162,168],"such":[52],"way":[54],"solution":[57,77],"to":[58,88,108],"provides":[62],"bound":[64,73],"which":[65],"could":[66],"embedded":[68],"branch":[71],"and":[72,103,117,132,142],"schemes":[74],"for":[75,129],"problem.":[80],"This":[81,94],"method":[85],"analogous":[87],"Langrangian":[89],"integer":[92],"programming.":[93],"paper":[95,164],"gives":[96],"survey":[98],"this":[100,163],"new":[101],"methodology,":[102],"gives,":[104],"as":[105,148],"examples,":[106],"applications":[107],"traveling":[110],"salesman":[111],"problem":[112,121],"(TSP),":[113],"time\u2010constrained":[115],"TSP":[116],"vehicle":[119],"routing":[120],"(VRP).":[122],"Valid":[123],"relaxations":[126],"discussed":[128,147],"these":[130],"several":[133],"bounds":[134],"derived":[136],"each":[138],"case.":[139],"Subgradient":[140],"\u201cstate":[143],"ascent\u201d":[145],"methods":[149],"maximizing":[151],"resulting":[153],"lower":[154],"bounds.":[155],"More":[156],"details":[157],"procedures":[160],"surveyed":[161],"found":[167],"[2,":[169],"3,":[170],"4].":[171]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":19},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":10}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}