{"id":"https://openalex.org/W4410498687","doi":"https://doi.org/10.1007/s10107-025-02234-z","title":"Lower bounds on the complexity of mixed-integer programs for stable set and knapsack","display_name":"Lower bounds on the complexity of mixed-integer programs for stable set and knapsack","publication_year":2025,"publication_date":"2025-05-19","ids":{"openalex":"https://openalex.org/W4410498687","doi":"https://doi.org/10.1007/s10107-025-02234-z"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-025-02234-z","doi":"https://doi.org/10.1007/s10107-025-02234-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-025-02234-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-025-02234-z.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,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"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"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-025-02234-z.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042936703","display_name":"Jamico Schade","orcid":"https://orcid.org/0009-0005-2727-1163","observed_orcids":["https://orcid.org/0009-0005-2727-1163"]},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jamico Schade","raw_affiliation_strings":["Technical University of Munich, Munich, Germany"],"raw_orcid":"https://orcid.org/0009-0005-2727-1163","affiliations":[{"raw_affiliation_string":"Technical University of Munich, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025592127","display_name":"Makrand Sinha","orcid":"https://orcid.org/0000-0001-5702-2049","observed_orcids":["https://orcid.org/0000-0001-5702-2049"]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Makrand Sinha","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, Champaign, USA"],"raw_orcid":"https://orcid.org/0000-0001-5702-2049","affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023809656","display_name":"Stefan Weltge","orcid":"https://orcid.org/0000-0002-0102-8326","observed_orcids":["https://orcid.org/0000-0002-0102-8326"]},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stefan Weltge","raw_affiliation_strings":["Technical University of Munich, Munich, Germany"],"raw_orcid":"https://orcid.org/0000-0002-0102-8326","affiliations":[{"raw_affiliation_string":"Technical University of Munich, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023809656"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":{"value":3090,"currency":"USD","value_usd":3090},"fwci":0.5842,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54751586,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"216","issue":"1-2","first_page":"135","last_page":"176"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.0020000000949949026,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0006000000284984708,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.8119999766349792},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7940000295639038},{"id":"https://openalex.org/keywords/stable-set-problem","display_name":"stable set problem","score":0.9399999976158142},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"knapsack problem","score":0.9980000257492065},{"id":"https://openalex.org/keywords/integer-variables","display_name":"integer variables","score":0.6119999885559082},{"id":"https://openalex.org/keywords/extended-formulations","display_name":"extended formulations","score":0.8420000076293945},{"id":"https://openalex.org/keywords/stable-set-polytope","display_name":"stable set polytope","score":0.8820000290870667},{"id":"https://openalex.org/keywords/information-theoretic-lower-bounds","display_name":"information-theoretic lower bounds","score":0.8109999895095825}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9259039163589478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7838497161865234},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.7026506066322327},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5954259037971497},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5789811015129089},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49525347352027893},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4848402738571167},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.446699321269989},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3554084300994873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12195530533790588},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10107-025-02234-z","doi":"https://doi.org/10.1007/s10107-025-02234-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-025-02234-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-025-02234-z.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,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"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:arXiv.org:2308.16711","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2308.16711","pdf_url":"https://arxiv.org/pdf/2308.16711","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.2308.16711","doi":"https://doi.org/10.48550/arxiv.2308.16711","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2308.16711","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.1007/s10107-025-02234-z","doi":"https://doi.org/10.1007/s10107-025-02234-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-025-02234-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-025-02234-z.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,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-1","vabb-shw"],"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":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G2363520468","display_name":"GRK 2201: Fortgeschrittene Optimierung in der vernetzten Wirtschaft","funder_award_id":"277991500","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7305375270","display_name":"Erweiterte Formulierungen der n\u00e4chsten Generation","funder_award_id":"451026932","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4410498687.pdf","grobid_xml":"https://content.openalex.org/works/W4410498687.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1594553832","https://openalex.org/W1755753347","https://openalex.org/W1967232806","https://openalex.org/W1969534344","https://openalex.org/W1992974842","https://openalex.org/W1998919258","https://openalex.org/W2006901918","https://openalex.org/W2021972008","https://openalex.org/W2023307697","https://openalex.org/W2057978375","https://openalex.org/W2091039687","https://openalex.org/W2134443705","https://openalex.org/W2150285483","https://openalex.org/W2291562724","https://openalex.org/W2337855014","https://openalex.org/W2460637059","https://openalex.org/W2759253428","https://openalex.org/W2771025477","https://openalex.org/W2773049524","https://openalex.org/W2892107877","https://openalex.org/W4211154544"],"related_works":["https://openalex.org/W3046357074","https://openalex.org/W2167525805","https://openalex.org/W2952946010","https://openalex.org/W2773049524","https://openalex.org/W2076307373","https://openalex.org/W3134738845","https://openalex.org/W1548640495","https://openalex.org/W2065139435","https://openalex.org/W3127315540","https://openalex.org/W3020834307"],"abstract_inverted_index":{"Abstract":[0],"Standard":[1],"mixed-integer":[2],"programming":[3],"formulations":[4,201],"for":[5,33,65,144,147,195],"the":[6,75,99,129,177,192,196],"stable":[7,125],"set":[8,126],"problem":[9],"on":[10,104],"n":[11,15,30,48,52,66,87,90,121,139,166,169],"-node":[12,31,122],"graphs":[13,32,123],"require":[14],"integer":[16,54],"variables.":[17,55],"We":[18,25],"prove":[19],"that":[20,115],"this":[21,73,111],"is":[22],"almost":[23],"optimal:":[24],"give":[26],"a":[27,57,118],"family":[28,119],"of":[29,79,98,120,198],"which":[34],"every":[35],"polynomial-size":[36],"MIP":[37],"formulation":[38,143],"requires":[39],"$$":[40,45,80,84,150],"\\varOmega":[41,81],"(n/\\log":[42,161],"^2":[43],"n)":[44,83],"\u03a9":[46,85,164],"(":[47,86,135,165],"/":[49,88,167],"log":[50,89,168],"2":[51,163],")":[53,91,140,170],"By":[56],"polyhedral":[58],"reduction":[59],"we":[60,113],"obtain":[61],"an":[62],"analogous":[63],"result":[64,194],"-item":[67],"knapsack":[68],"problems.":[69],"In":[70],"both":[71],"cases,":[72],"improves":[74],"previously":[76],"known":[77],"bounds":[78],"(\\sqrt{n}/\\log":[82],"by":[92],"Cevallos":[93],"et":[94,183],"al.":[95,184],"(in":[96],"Proceedings":[97],"twenty-ninth":[100],"annual":[101],"ACM-SIAM":[102],"symposium":[103],"discrete":[105],"algorithms":[106],"(SODA),":[107],"SIAM,":[108],"2018).":[109],"To":[110],"end,":[112],"show":[114],"there":[116],"exists":[117],"whose":[124],"polytopes":[127],"satisfy":[128],"following:":[130],"any":[131],"$$(1+\\nicefrac":[132],"{\\varepsilon":[133],"}{n})$$":[134],"1":[136],"+":[137],"\u03b5":[138,154,206],"-approximate":[141],"extended":[142,200],"these":[145],"polytopes,":[146],"some":[148],"constant":[149],"\\varepsilon":[151],">":[152,155],"0$$":[153,205],"0":[156,208],",":[157],"has":[158],"size":[159],"$$2^{\\varOmega":[160],"n)}$$":[162],".":[171],"Our":[172],"proof":[173],"extends":[174],"and":[175],"simplifies":[176],"information-theoretic":[178],"methods":[179],"due":[180],"to":[181],"G\u00f6\u00f6s":[182],"(SIAM":[185],"J":[186],"Comput":[187],"47(1):241\u2013269,":[188],"2018)":[189],"who":[190],"showed":[191],"same":[193],"case":[197],"exact":[199],"(i.e.":[202],"$$\\varepsilon":[203],"=":[204,207],").":[209]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2025-05-20T00:00:00"}
