{"id":"https://openalex.org/W2700706181","doi":"https://doi.org/10.24963/ijcai.2017/85","title":"Solving Integer Linear Programs with a Small Number of Global Variables and Constraints","display_name":"Solving Integer Linear Programs with a Small Number of Global Variables and Constraints","publication_year":2017,"publication_date":"2017-07-28","ids":{"openalex":"https://openalex.org/W2700706181","doi":"https://doi.org/10.24963/ijcai.2017/85","mag":"2700706181"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2017/85","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/85","pdf_url":"https://www.ijcai.org/proceedings/2017/0085.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2017/0085.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084130815","display_name":"Pavel Dvo\u0159\u00e1k","orcid":"https://orcid.org/0000-0002-6838-1538"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Dvo\u0159\u00e1k","raw_affiliation_strings":["Charles University, Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066848088","display_name":"Eduard Eiben","orcid":"https://orcid.org/0000-0003-2628-3435"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Eduard Eiben","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088116512","display_name":"Robert Ganian","orcid":"https://orcid.org/0000-0002-7762-8045"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Robert Ganian","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073361240","display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Du\u0161an Knop","raw_affiliation_strings":["Charles University, Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017076947","display_name":"Sebastian Ordyniak","orcid":"https://orcid.org/0000-0003-1935-651X"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Sebastian Ordyniak","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2915,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.89474994,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"607","last_page":"613"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9966999888420105,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7126671075820923},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6334474086761475},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5964342951774597},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.579809844493866},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5654630064964294},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5458763241767883},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5392372608184814},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5108761191368103},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4733828604221344},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4524192214012146},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36923202872276306},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3074485659599304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24255117774009705}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7126671075820923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6334474086761475},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5964342951774597},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.579809844493866},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5654630064964294},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5458763241767883},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5392372608184814},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5108761191368103},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4733828604221344},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4524192214012146},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36923202872276306},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3074485659599304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24255117774009705},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2017/85","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/85","pdf_url":"https://www.ijcai.org/proceedings/2017/0085.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2017/85","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/85","pdf_url":"https://www.ijcai.org/proceedings/2017/0085.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2761285720","display_name":null,"funder_award_id":"FP/2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5566021001","display_name":null,"funder_award_id":"P202/12/G061","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G5593277320","display_name":null,"funder_award_id":"2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5610024377","display_name":"Exploiting New Types of Structure for Fixed Parameter Tractability (X-TRACT)","funder_award_id":"P26696","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2700706181.pdf","grobid_xml":"https://content.openalex.org/works/W2700706181.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W23064316","https://openalex.org/W37846821","https://openalex.org/W789853836","https://openalex.org/W1177680066","https://openalex.org/W1489779243","https://openalex.org/W1513894211","https://openalex.org/W1578513650","https://openalex.org/W1588457598","https://openalex.org/W1601649239","https://openalex.org/W1732327014","https://openalex.org/W1779426617","https://openalex.org/W1968319543","https://openalex.org/W2032392871","https://openalex.org/W2037968786","https://openalex.org/W2061881283","https://openalex.org/W2114616381","https://openalex.org/W2116087731","https://openalex.org/W2128361327","https://openalex.org/W2246468915","https://openalex.org/W2460257212","https://openalex.org/W2490706771","https://openalex.org/W2600918792","https://openalex.org/W2914414140","https://openalex.org/W3103589466","https://openalex.org/W4213255380","https://openalex.org/W4289143832"],"related_works":["https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668"],"abstract_inverted_index":{"Integer":[0],"Linear":[1],"Programming":[2],"(ILP)":[3],"has":[4],"a":[5,25,42,71,160],"broad":[6],"range":[7],"of":[8,13,19,28,41,45,55,59,70,85,128,138,164],"applications":[9],"in":[10,17,68,143],"various":[11],"areas":[12],"artificial":[14],"intelligence.":[15],"Yet":[16],"spite":[18],"recent":[20],"advances,":[21],"we":[22,36,74,99,114,147],"still":[23],"lack":[24],"thorough":[26],"understanding":[27],"which":[29,78],"structural":[30,72],"restrictions":[31],"make":[32],"ILP":[33,38,87,165],"tractable.":[34],"Here":[35],"study":[37],"instances":[39],"consisting":[40],"small":[43,60],"number":[44,137],"``global''":[46],"variables":[47,140],"and/or":[48],"constraints":[49,142],"such":[50],"that":[51],"the":[52,56,82,126,136,144,149],"remaining":[53],"part":[54],"instance":[57],"consists":[58],"and":[61,104,107],"otherwise":[62],"independent":[63],"components;":[64],"this":[65],"is":[66],"captured":[67],"terms":[69],"measure":[73],"call":[75],"fracture":[76,102,169],"backdoors":[77,103,117],"generalizes,":[79],"for":[80,110,124],"instance,":[81],"well-studied":[83],"class":[84],"N-fold":[86],"instances.":[88],"Our":[89],"main":[90],"contributions":[91],"can":[92],"be":[93],"divided":[94],"into":[95],"three":[96],"parts.":[97],"First,":[98],"formally":[100],"develop":[101,119],"obtain":[105],"exact":[106],"approximation":[108],"algorithms":[109,123,130,151],"computing":[111],"these.":[112],"Second,":[113],"exploit":[115],"these":[116,129],"to":[118,168],"several":[120],"new":[121],"parameterized":[122],"ILP;":[125],"performance":[127],"will":[131],"naturally":[132],"scale":[133],"based":[134],"on":[135],"global":[139],"or":[141],"instance.":[145],"Finally,":[146],"complement":[148],"developed":[150],"with":[152,166],"matching":[153],"lower":[154],"bounds.":[155],"Altogether,":[156],"our":[157],"results":[158],"paint":[159],"near-complete":[161],"complexity":[162],"landscape":[163],"respect":[167],"backdoors.":[170]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-13T07:31:44.756512","created_date":"2025-10-10T00:00:00"}