{"id":"https://openalex.org/W3196973566","doi":"https://doi.org/10.1007/s12532-023-00235-7","title":"On the generation of metric TSP instances with a large integrality gap by branch-and-cut","display_name":"On the generation of metric TSP instances with a large integrality gap by branch-and-cut","publication_year":2023,"publication_date":"2023-03-27","ids":{"openalex":"https://openalex.org/W3196973566","doi":"https://doi.org/10.1007/s12532-023-00235-7","mag":"3196973566"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-023-00235-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-023-00235-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-023-00235-7.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s12532-023-00235-7.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088620645","display_name":"Eleonora Vercesi","orcid":"https://orcid.org/0000-0002-1621-2484"},"institutions":[{"id":"https://openalex.org/I25217355","display_name":"University of Pavia","ror":"https://ror.org/00s6t1f81","country_code":"IT","type":"education","lineage":["https://openalex.org/I25217355"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Eleonora Vercesi","raw_affiliation_strings":["Dipartimento di Matematica \u201cF. Casorati\u201d, Universit\u00e0 degli Studi di Pavia, Pavia, Italy","Dipartimento di Matematica \"F. Casorati\", Universit\u00e0 degli Studi di Pavia, Pavia, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica \u201cF. Casorati\u201d, Universit\u00e0 degli Studi di Pavia, Pavia, Italy","institution_ids":["https://openalex.org/I25217355"]},{"raw_affiliation_string":"Dipartimento di Matematica \"F. Casorati\", Universit\u00e0 degli Studi di Pavia, Pavia, Italy","institution_ids":["https://openalex.org/I25217355"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060689993","display_name":"Stefano Gualandi","orcid":"https://orcid.org/0000-0002-2111-3528"},"institutions":[{"id":"https://openalex.org/I25217355","display_name":"University of Pavia","ror":"https://ror.org/00s6t1f81","country_code":"IT","type":"education","lineage":["https://openalex.org/I25217355"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Gualandi","raw_affiliation_strings":["Dipartimento di Matematica \u201cF. Casorati\u201d, Universit\u00e0 degli Studi di Pavia, Pavia, Italy","Dipartimento di Matematica \"F. Casorati\", Universit\u00e0 degli Studi di Pavia, Pavia, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica \u201cF. Casorati\u201d, Universit\u00e0 degli Studi di Pavia, Pavia, Italy","institution_ids":["https://openalex.org/I25217355"]},{"raw_affiliation_string":"Dipartimento di Matematica \"F. Casorati\", Universit\u00e0 degli Studi di Pavia, Pavia, Italy","institution_ids":["https://openalex.org/I25217355"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053978143","display_name":"Monaldo Mastrolilli","orcid":"https://orcid.org/0000-0002-2948-9749"},"institutions":[{"id":"https://openalex.org/I15196421","display_name":"University of Applied Sciences and Arts of Southern Switzerland","ror":"https://ror.org/05ep8g269","country_code":"CH","type":"education","lineage":["https://openalex.org/I15196421"]},{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Monaldo Mastrolilli","raw_affiliation_strings":["IDSIA - USI-SUPSI, Lugano, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IDSIA - USI-SUPSI, Lugano, Switzerland","institution_ids":["https://openalex.org/I15196421","https://openalex.org/I2614128279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109533956","display_name":"Luca Maria Gambardella","orcid":"https://orcid.org/0009-0004-2555-1762"},"institutions":[{"id":"https://openalex.org/I15196421","display_name":"University of Applied Sciences and Arts of Southern Switzerland","ror":"https://ror.org/05ep8g269","country_code":"CH","type":"education","lineage":["https://openalex.org/I15196421"]},{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Luca Maria Gambardella","raw_affiliation_strings":["Faculty of Informatics, USI, IDSIA - USI-SUPSI, Lugano, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, USI, IDSIA - USI-SUPSI, Lugano, Switzerland","institution_ids":["https://openalex.org/I15196421","https://openalex.org/I2614128279"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088620645"],"corresponding_institution_ids":["https://openalex.org/I25217355"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":{"value":3090,"currency":"USD","value_usd":3090},"fwci":1.2861,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.80145819,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"15","issue":"2","first_page":"389","last_page":"416"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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.9642999768257141,"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.7124391198158264},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6255540251731873},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6173148155212402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5625940561294556},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5350177884101868},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4976530373096466},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49370965361595154},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.49121636152267456},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4151424169540405},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4038749635219574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.377032071352005},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34546446800231934}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7124391198158264},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6255540251731873},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6173148155212402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5625940561294556},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5350177884101868},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4976530373096466},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49370965361595154},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.49121636152267456},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4151424169540405},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4038749635219574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.377032071352005},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34546446800231934},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s12532-023-00235-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-023-00235-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-023-00235-7.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s12532-023-00235-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-023-00235-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-023-00235-7.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6899999976158142,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322874","display_name":"Universit\u00e0 degli Studi di Pavia","ror":"https://ror.org/00s6t1f81"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3196973566.pdf"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W67941580","https://openalex.org/W201222650","https://openalex.org/W588431997","https://openalex.org/W626292722","https://openalex.org/W1559839959","https://openalex.org/W1582969422","https://openalex.org/W1714357736","https://openalex.org/W1877952604","https://openalex.org/W1976222519","https://openalex.org/W1991119408","https://openalex.org/W2003687734","https://openalex.org/W2012329067","https://openalex.org/W2014294736","https://openalex.org/W2017708378","https://openalex.org/W2029242918","https://openalex.org/W2035230178","https://openalex.org/W2042986967","https://openalex.org/W2049287714","https://openalex.org/W2055747219","https://openalex.org/W2058937865","https://openalex.org/W2063986634","https://openalex.org/W2064287614","https://openalex.org/W2068748054","https://openalex.org/W2070664846","https://openalex.org/W2100440346","https://openalex.org/W2106318612","https://openalex.org/W2107535850","https://openalex.org/W2123037532","https://openalex.org/W2125299871","https://openalex.org/W2134959010","https://openalex.org/W2139059344","https://openalex.org/W2163428398","https://openalex.org/W2189345514","https://openalex.org/W2270533177","https://openalex.org/W2886940793","https://openalex.org/W3106514481","https://openalex.org/W3126476765","https://openalex.org/W4254926090","https://openalex.org/W6600656670","https://openalex.org/W6949827319"],"related_works":["https://openalex.org/W2769220156","https://openalex.org/W3006617646","https://openalex.org/W2009796757","https://openalex.org/W4210880521","https://openalex.org/W2046300504","https://openalex.org/W2263874601","https://openalex.org/W2734758384","https://openalex.org/W1593376002","https://openalex.org/W104270770","https://openalex.org/W1968202374"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"introduces":[3],"a":[4,16,38,48,53,119,199,205,215],"computational":[5,185],"method":[6,21,190],"for":[7,104,122,156,178,226],"generating":[8],"metric":[9,95,132,210],"Travelling":[10],"Salesman":[11],"Problem":[12,45],"(TSP)":[13],"instances":[14,212],"having":[15,56],"large":[17,112,216],"integrality":[18,58,66,217],"gap.":[19],"The":[20,72],"is":[22,191],"based":[23],"on":[24,47],"the":[25,42,65,69,78,81,86,91,94,110,131,137,147,153,167,175,180,203],"solution":[26,40],"of":[27,41,68,75,80,93,101,114,146,207,224],"an":[28,57,98],"integer":[29],"programming":[30],"problem,":[31],"called":[32],"IH-OPT,":[33],"that":[34,188],"takes":[35],"as":[36],"input":[37],"fractional":[39,144],"Subtour":[43],"Elimination":[44],"(SEP)":[46],"TSP":[49,54,82,107,169,182,211],"instance":[50,55,170],"and":[51,85,134,219],"computes":[52],"gap":[59,67,218],"larger":[60],"than":[61],"or":[62],"equal":[63],"to":[64],"first":[70],"instance.":[71],"decision":[73],"variables":[74],"IH-OPT":[76,154],"are":[77,88,220],"entries":[79],"cost":[83,128,172],"matrix,":[84],"constraints":[87],"defined":[89],"by":[90,126,135],"intersection":[92],"cone":[96],"with":[97],"exponential":[99],"number":[100,113],"inequalities,":[102],"one":[103],"each":[105],"possible":[106],"tour.":[108],"Given":[109],"very":[111,192],"constraints,":[115],"we":[116,140,151,164,201],"have":[117,214],"implemented":[118],"branch-and-cut":[120,162],"algorithm":[121],"solving":[123,136],"IH-OPT.":[124],"Then,":[125],"sampling":[127],"vectors":[129],"over":[130],"polytope":[133],"corresponding":[138],"SEP,":[139],"can":[141,165],"generate":[142],"random":[143],"vertices":[145],"SEP":[148],"polytope.":[149],"If":[150],"solve":[152],"problem":[155],"every":[157],"sampled":[158],"vertex":[159],"using":[160],"our":[161,189],"algorithm,":[163],"select":[166],"generated":[168],"(i.e.,":[171],"vector),":[173],"yielding":[174],"longest":[176],"runtime":[177,225],"Concorde,":[179],"state-of-the-art":[181],"solver.":[183],"Our":[184],"results":[186],"show":[187],"effective":[193],"in":[194,222],"producing":[195],"challenging":[196,221],"instances.":[197],"As":[198],"by-product,":[200],"release":[202],",":[204],"library":[206],"41":[208],"small":[209],"which":[213],"terms":[223],"Concorde.":[227]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}