{"id":"https://openalex.org/W4392738999","doi":"https://doi.org/10.1007/s10107-024-02069-0","title":"The Chv\u00e1tal\u2013Gomory procedure for integer SDPs with applications in combinatorial optimization","display_name":"The Chv\u00e1tal\u2013Gomory procedure for integer SDPs with applications in combinatorial optimization","publication_year":2024,"publication_date":"2024-03-13","ids":{"openalex":"https://openalex.org/W4392738999","doi":"https://doi.org/10.1007/s10107-024-02069-0"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-024-02069-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-024-02069-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-024-02069-0.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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","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/s10107-024-02069-0.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020012395","display_name":"Frank de Meijer","orcid":"https://orcid.org/0000-0002-1910-0699"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Frank de Meijer","raw_affiliation_strings":["Delft Institute of Applied Mathematics, Delft University of Technology, Delft, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-1910-0699","affiliations":[{"raw_affiliation_string":"Delft Institute of Applied Mathematics, Delft University of Technology, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082314475","display_name":"Renata Sotirov","orcid":"https://orcid.org/0000-0002-3298-7255"},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Renata Sotirov","raw_affiliation_strings":["CentER, Department of Econometrics and OR, Tilburg University, Tilburg, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-3298-7255","affiliations":[{"raw_affiliation_string":"CentER, Department of Econometrics and OR, Tilburg University, Tilburg, The Netherlands","institution_ids":["https://openalex.org/I193700539"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020012395"],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":1.5776,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.83711926,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"209","issue":"1-2","first_page":"323","last_page":"395"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9972000122070312,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9972000122070312,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9850999712944031,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7383167147636414},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6704190969467163},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.628557026386261},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.6192030310630798},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5510268807411194},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5295501947402954},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44567230343818665},{"id":"https://openalex.org/keywords/combinatorial-analysis","display_name":"Combinatorial analysis","score":0.42755916714668274},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23300498723983765}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7383167147636414},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6704190969467163},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.628557026386261},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.6192030310630798},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5510268807411194},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5295501947402954},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44567230343818665},{"id":"https://openalex.org/C2987825933","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorial analysis","level":2,"score":0.42755916714668274},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23300498723983765},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10107-024-02069-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-024-02069-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-024-02069-0.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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","raw_type":"journal-article"},{"id":"pmh:oai:tudelft.nl:uuid:0e4af207-3298-4671-944f-5fd6dc0cd655","is_oa":false,"landing_page_url":"http://resolver.tudelft.nl/uuid:0e4af207-3298-4671-944f-5fd6dc0cd655","pdf_url":null,"source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"journal article"}],"best_oa_location":{"id":"doi:10.1007/s10107-024-02069-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-024-02069-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-024-02069-0.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4392738999.pdf"},"referenced_works_count":61,"referenced_works":["https://openalex.org/W1489954660","https://openalex.org/W1508501959","https://openalex.org/W1560628405","https://openalex.org/W1587744656","https://openalex.org/W1604158939","https://openalex.org/W1668282207","https://openalex.org/W1918578756","https://openalex.org/W1918816242","https://openalex.org/W1959100419","https://openalex.org/W1964191135","https://openalex.org/W1988671860","https://openalex.org/W2000889179","https://openalex.org/W2009683816","https://openalex.org/W2015622114","https://openalex.org/W2015982615","https://openalex.org/W2016918503","https://openalex.org/W2029880758","https://openalex.org/W2033498477","https://openalex.org/W2035412546","https://openalex.org/W2035877252","https://openalex.org/W2042044648","https://openalex.org/W2046982002","https://openalex.org/W2049505431","https://openalex.org/W2061607408","https://openalex.org/W2065706751","https://openalex.org/W2071771001","https://openalex.org/W2072484718","https://openalex.org/W2100558818","https://openalex.org/W2106292145","https://openalex.org/W2106871914","https://openalex.org/W2113011069","https://openalex.org/W2115832833","https://openalex.org/W2117457604","https://openalex.org/W2120983471","https://openalex.org/W2131446100","https://openalex.org/W2134946135","https://openalex.org/W2135054793","https://openalex.org/W2145243417","https://openalex.org/W2149407242","https://openalex.org/W2149962042","https://openalex.org/W2163428398","https://openalex.org/W2308191028","https://openalex.org/W2527757967","https://openalex.org/W2547864521","https://openalex.org/W2562729437","https://openalex.org/W2569749172","https://openalex.org/W2582342290","https://openalex.org/W2748358779","https://openalex.org/W2887688500","https://openalex.org/W2908190952","https://openalex.org/W2922057699","https://openalex.org/W2988221399","https://openalex.org/W3006858192","https://openalex.org/W3007817717","https://openalex.org/W3034142766","https://openalex.org/W3048043108","https://openalex.org/W3105558219","https://openalex.org/W3119649271","https://openalex.org/W3190594047","https://openalex.org/W4233681555","https://openalex.org/W4297831302"],"related_works":["https://openalex.org/W2048233275","https://openalex.org/W2110818895","https://openalex.org/W2045076853","https://openalex.org/W1973064890","https://openalex.org/W2065369945","https://openalex.org/W3006617646","https://openalex.org/W3126345618","https://openalex.org/W2038141985","https://openalex.org/W4306408105","https://openalex.org/W4210979444"],"abstract_inverted_index":{"Abstract":[0],"In":[1,118],"this":[2,31],"paper":[3,124],"we":[4,67,125],"study":[5,35],"the":[6,12,24,39,48,86,88,96,99,119,123,134,144,148,156,163,180,184],"well-known":[7,172],"Chv\u00e1tal\u2013Gomory":[8],"(CG)":[9],"procedure":[10],"for":[11,51,64,79,106],"class":[13],"of":[14,26,38,42,47,55,110,122,130,147,174,183],"integer":[15],"semidefinite":[16,97],"programs":[17],"(ISDPs).":[18],"We":[19,33,102,160],"prove":[20],"several":[21,107,171],"results":[22,178],"regarding":[23],"hierarchy":[25],"relaxations":[27],"obtained":[28],"by":[29,59],"iterating":[30],"procedure.":[32],"also":[34],"different":[36],"formulations":[37,169],"elementary":[40,49],"closure":[41,50],"spectrahedra.":[43],"A":[44],"polyhedral":[45],"description":[46],"a":[52,76,127],"specific":[53],"type":[54],"spectrahedra":[56],"is":[57,197],"derived":[58],"exploiting":[60],"total":[61],"dual":[62],"integrality":[63,100],"SDPs.":[65],"Moreover,":[66],"show":[68,161],"how":[69],"to":[70,133,199,204],"exploit":[71],"(strengthened)":[72],"CG":[73,164,185],"cuts":[74,165,186],"in":[75,85,91,187],"branch-and-cut":[77,189],"framework":[78],"ISDPs.":[80],"Different":[81],"from":[82,114,167],"existing":[83],"algorithms":[84],"literature,":[87],"separation":[89,104],"routine":[90],"our":[92,131,188],"approach":[93,132],"exploits":[94],"both":[95],"and":[98,196],"constraints.":[101],"provide":[103],"routines":[105],"common":[108],"classes":[109],"binary":[111],"SDPs":[112],"resulting":[113,166],"combinatorial":[115],"optimization":[116],"problems.":[117],"second":[120],"part":[121],"present":[126],"comprehensive":[128],"application":[129],"quadratic":[135],"traveling":[136],"salesman":[137],"problem":[138],"(":[139],"QTSP":[140,157,202],").":[141],"Based":[142],"on":[143],"algebraic":[145],"connectivity":[146],"directed":[149],"Hamiltonian":[150],"cycle,":[151],"two":[152],"ISDPs":[153],"that":[154,162],"model":[155],"are":[158],"introduced.":[159],"these":[168],"contain":[170],"families":[173],"cutting":[175],"planes.":[176],"Numerical":[177],"illustrate":[179],"practical":[181],"strength":[182],"algorithm,":[190],"which":[191],"outperforms":[192],"alternative":[193],"ISDP":[194],"solvers":[195],"able":[198],"solve":[200],"large":[201],"instances":[203],"optimality.":[205]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}