{"id":"https://openalex.org/W2029242918","doi":"https://doi.org/10.1137/1033004","title":"A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems","display_name":"A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems","publication_year":1991,"publication_date":"1991-03-01","ids":{"openalex":"https://openalex.org/W2029242918","doi":"https://doi.org/10.1137/1033004","mag":"2029242918"},"language":"en","primary_location":{"id":"doi:10.1137/1033004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1033004","pdf_url":null,"source":{"id":"https://openalex.org/S160107561","display_name":"SIAM Review","issn_l":"0036-1445","issn":["0036-1445","1095-7200"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Review","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/A5034195079","display_name":"Manfred Padberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manfred Padberg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103158920","display_name":"Giovanni Rinaldi","orcid":"https://orcid.org/0000-0003-0148-2470"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Giovanni Rinaldi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":46.6834,"has_fulltext":false,"cited_by_count":1076,"citation_normalized_percentile":{"value":0.99905375,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"33","issue":"1","first_page":"60","last_page":"100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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.9926000237464905,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9869999885559082,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7702606320381165},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.6816540956497192},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6596501469612122},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.622212290763855},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5893895626068115},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5612455606460571},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5247014760971069},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48119884729385376},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4710155725479126},{"id":"https://openalex.org/keywords/pentium","display_name":"Pentium","score":0.46002286672592163},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4564911723136902},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.4478333294391632},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43958476185798645},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.418315589427948},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40283918380737305},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.38971641659736633},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3109491467475891},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17013630270957947},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.16004258394241333}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7702606320381165},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.6816540956497192},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6596501469612122},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.622212290763855},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5893895626068115},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5612455606460571},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5247014760971069},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48119884729385376},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4710155725479126},{"id":"https://openalex.org/C46268123","wikidata":"https://www.wikidata.org/wiki/Q214314","display_name":"Pentium","level":2,"score":0.46002286672592163},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4564911723136902},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4478333294391632},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43958476185798645},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.418315589427948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40283918380737305},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.38971641659736633},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3109491467475891},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17013630270957947},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.16004258394241333},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/1033004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1033004","pdf_url":null,"source":{"id":"https://openalex.org/S160107561","display_name":"SIAM Review","issn_l":"0036-1445","issn":["0036-1445","1095-7200"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Review","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.125.8996","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.8996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www4.ncsu.edu/~kksivara/ma505spring2007/handouts/padberg-rinaldi-tsp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.448.2020","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.448.2020","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www4.ncsu.edu/~kksivara/ma505spring2007/handouts/padberg-rinaldi-tsp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.467.1903","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.467.1903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lev4projdissertation.googlecode.com/svn/trunk/reading/2030652.pdf","raw_type":"text"},{"id":"pmh:hdl:10068/317600","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/317600","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Y - Progress report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W5720473","https://openalex.org/W83064900","https://openalex.org/W224775207","https://openalex.org/W249091067","https://openalex.org/W307896644","https://openalex.org/W368793154","https://openalex.org/W996280192","https://openalex.org/W1540760152","https://openalex.org/W1964127155","https://openalex.org/W1964683996","https://openalex.org/W1967508804","https://openalex.org/W1968143987","https://openalex.org/W1970855160","https://openalex.org/W1991119408","https://openalex.org/W1992928037","https://openalex.org/W2005944337","https://openalex.org/W2006934540","https://openalex.org/W2009803313","https://openalex.org/W2012329067","https://openalex.org/W2019827501","https://openalex.org/W2020736457","https://openalex.org/W2021199373","https://openalex.org/W2029392610","https://openalex.org/W2033662447","https://openalex.org/W2041584418","https://openalex.org/W2042986967","https://openalex.org/W2055360661","https://openalex.org/W2058748455","https://openalex.org/W2066271905","https://openalex.org/W2083601726","https://openalex.org/W2086315201","https://openalex.org/W2086863198","https://openalex.org/W2114552889","https://openalex.org/W2117107845","https://openalex.org/W2123805664","https://openalex.org/W2134092250","https://openalex.org/W2141928660","https://openalex.org/W2161305900","https://openalex.org/W2336259629","https://openalex.org/W2399100674","https://openalex.org/W2400401042","https://openalex.org/W2505968561","https://openalex.org/W3139666781","https://openalex.org/W4205684726","https://openalex.org/W4242003284","https://openalex.org/W4246060548"],"related_works":["https://openalex.org/W3006617646","https://openalex.org/W2379672298","https://openalex.org/W1531708257","https://openalex.org/W2387389269","https://openalex.org/W3162501176","https://openalex.org/W3104290058","https://openalex.org/W4310251946","https://openalex.org/W4303982878","https://openalex.org/W2089185195","https://openalex.org/W1464660497"],"abstract_inverted_index":{"An":[0],"algorithm":[1,21,81,98,121,191],"is":[2,22,131],"described":[3,64,132],"for":[4],"solving":[5],"large-scale":[6,174],"instances":[7,180],"of":[8,19,31,34,41,45,49,119,127,140,161,178],"the":[9,20,32,38,42,46,70,80,114,120,123,128,138,162,169,179,190],"Symmetric":[10],"Traveling":[11],"Salesman":[12],"Problem":[13],"(STSP)":[14],"to":[15,89,136,149,157,187],"optimality.":[16],"The":[17,53,97,117],"core":[18],"a":[23,29,50,66,83],"\u201cpolyhedral\u201d":[24],"cutting-plane":[25,71],"procedure":[26,72],"that":[27,61],"exploits":[28],"subset":[30],"system":[33],"linear":[35,106],"inequalities":[36],"defining":[37],"convex":[39],"hull":[40],"incidence":[43],"vectors":[44],"hamiltonian":[47],"cycles":[48],"complete":[51],"graph.":[52],"cuts":[54,94],"are":[55,145,166,173],"generated":[56],"by":[57,189],"several":[58],"identification":[59],"procedures":[60],"have":[62,110],"been":[63,100,111],"in":[65,102,133,182,192],"companion":[67],"paper.":[68],"Whenever":[69],"does":[73],"not":[74],"terminate":[75],"with":[76,125,147,152],"an":[77],"optimal":[78],"solution":[79],"uses":[82],"tree-search":[84],"strategy":[85],"that,":[86],"as":[87,113],"opposed":[88],"branch-and-bound,":[90],"keeps":[91],"on":[92],"producing":[93],"after":[95],"branching.":[96],"has":[99],"implemented":[101],"FORTRAN.":[103],"Two":[104],"different":[105],"programming":[107],"(LP)":[108],"packages":[109],"used":[112],"LP":[115,129],"solver.":[116],"implementation":[118],"and":[122],"interface":[124],"one":[126],"solvers":[130],"sufficient":[134],"detail":[135],"permit":[137],"replication":[139],"our":[141],"experiments.":[142],"Computational":[143],"results":[144],"reported":[146],"up":[148],"42":[150],"STSPs":[151],"sizes":[153],"ranging":[154],"from":[155,168],"48":[156],"2,392":[158],"nodes.":[159],"Most":[160],"medium-sized":[163],"test":[164],"problems":[165],"taken":[167],"literature;":[170],"all":[171],"others":[172],"real-world":[175],"problems.":[176],"All":[177],"considered":[181],"this":[183],"study":[184],"were":[185],"solved":[186],"optimality":[188],"\u201creasonable\u201d":[193],"computation":[194],"times.":[195]},"counts_by_year":[{"year":2026,"cited_by_count":14},{"year":2025,"cited_by_count":32},{"year":2024,"cited_by_count":35},{"year":2023,"cited_by_count":44},{"year":2022,"cited_by_count":35},{"year":2021,"cited_by_count":44},{"year":2020,"cited_by_count":48},{"year":2019,"cited_by_count":59},{"year":2018,"cited_by_count":50},{"year":2017,"cited_by_count":47},{"year":2016,"cited_by_count":46},{"year":2015,"cited_by_count":37},{"year":2014,"cited_by_count":56},{"year":2013,"cited_by_count":27},{"year":2012,"cited_by_count":33}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2025-10-10T00:00:00"}