{"id":"https://openalex.org/W2962850932","doi":"https://doi.org/10.1145/3330137","title":"Evaluating and Tuning n -fold Integer Programming","display_name":"Evaluating and Tuning n -fold Integer Programming","publication_year":2019,"publication_date":"2019-07-19","ids":{"openalex":"https://openalex.org/W2962850932","doi":"https://doi.org/10.1145/3330137","mag":"2962850932"},"language":"en","primary_location":{"id":"doi:10.1145/3330137","doi":"https://doi.org/10.1145/3330137","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3330137","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-2","norway-1","poland-100","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5026261798","display_name":"Kate\u0159ina Altmanov\u00e1","orcid":null,"observed_orcids":[]},"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":"Kate\u0159ina Altmanov\u00e1","raw_affiliation_strings":["Department of Applied Mathematics, Charles University, Praha, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Charles University, Praha, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073361240","display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709","observed_orcids":["https://orcid.org/0000-0003-2588-5709"]},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]},{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["CZ","DE"],"is_corresponding":false,"raw_author_name":"Du\u0161an Knop","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty\u00a0IV, Technische Univerzit\u00e4t Berlin, Germany and Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Praha, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty\u00a0IV, Technische Univerzit\u00e4t Berlin, Germany and Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Praha, Czech Republic","institution_ids":["https://openalex.org/I44504214","https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030598218","display_name":"Martin Kouteck\u00fd","orcid":"https://orcid.org/0000-0002-7846-0053","observed_orcids":["https://orcid.org/0000-0002-7846-0053"]},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]},{"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","IL"],"is_corresponding":false,"raw_author_name":"Martin Kouteck\u00fd","raw_affiliation_strings":["Technion\u2013Israel Institute of Technology, Israel and Computer Science Institute, Charles University, Praha, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion\u2013Israel Institute of Technology, Israel and Computer Science Institute, Charles University, Praha, Czech Republic","institution_ids":["https://openalex.org/I174306211","https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7116,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.83002813,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":96},"biblio":{"volume":"24","issue":null,"first_page":"1","last_page":"22"},"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.9932000041007996,"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.9932000041007996,"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.00430000014603138,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/algorithm-tuning","display_name":"algorithm tuning","score":0.335999995470047},{"id":"https://openalex.org/keywords/heuristic-search","display_name":"heuristic search","score":0.47200000286102295},{"id":"https://openalex.org/keywords/local-optima","display_name":"local optima","score":0.7879999876022339},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.3790000081062317},{"id":"https://openalex.org/keywords/string-algorithms","display_name":"string algorithms","score":0.46399998664855957},{"id":"https://openalex.org/keywords/computational-social-choice","display_name":"computational social choice","score":0.9419999718666077},{"id":"https://openalex.org/keywords/scheduling","display_name":"scheduling","score":0.7289999723434448}],"concepts":[{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5070371627807617},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4956320524215698},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.49287939071655273},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4734634757041931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46715253591537476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4430546462535858},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.44130098819732666},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4387640655040741},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3978806138038635},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2926671802997589},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3330137","doi":"https://doi.org/10.1145/3330137","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3330137","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-2","norway-1","poland-100","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G6299288861","display_name":null,"funder_award_id":"308/18","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W22357737","https://openalex.org/W23064316","https://openalex.org/W90049316","https://openalex.org/W163468006","https://openalex.org/W178407265","https://openalex.org/W590545282","https://openalex.org/W758637612","https://openalex.org/W1513894211","https://openalex.org/W1553900433","https://openalex.org/W1562251253","https://openalex.org/W1574484665","https://openalex.org/W1696146724","https://openalex.org/W1779426617","https://openalex.org/W2004489140","https://openalex.org/W2008454042","https://openalex.org/W2011301426","https://openalex.org/W2147554944","https://openalex.org/W2152514082","https://openalex.org/W2172226214","https://openalex.org/W2187435247","https://openalex.org/W2293616868","https://openalex.org/W2472803348","https://openalex.org/W2617606106","https://openalex.org/W2779795514","https://openalex.org/W2786579920","https://openalex.org/W2898958363","https://openalex.org/W2930306418","https://openalex.org/W2963126600","https://openalex.org/W3106527427","https://openalex.org/W3127405590","https://openalex.org/W4232585008"],"related_works":["https://openalex.org/W3005979238","https://openalex.org/W2617606106","https://openalex.org/W1779426617","https://openalex.org/W1829416734","https://openalex.org/W7115882318","https://openalex.org/W2963126600","https://openalex.org/W4415507961","https://openalex.org/W2898958363","https://openalex.org/W3095908818","https://openalex.org/W2786579920"],"abstract_inverted_index":{"In":[0],"recent":[1],"years,":[2],"algorithmic":[3],"breakthroughs":[4],"in":[5,135,185,202,299],"stringology,":[6],"computational":[7],"social":[8],"choice,":[9],"scheduling,":[10],"and":[11,42,74,84,104,120,146,153,268,294],"so":[12],"on,":[13],"were":[14],"achieved":[15],"by":[16,111],"applying":[17],"the":[18,67,81,87,91,98,125,151,155,158,186,207,239,256,259,265,280,309,318,320,337],"theory":[19],"of":[20,78,80,90,101,171,258,264,271,289,308],"so-called":[21],"n":[22,27,61,85,121,243,245,248,251],"-fold":[23,28,122],"integer":[24,29],"programming.":[25],"An":[26],"program":[30],"(IP)":[31],"has":[32,142],"a":[33,114,136,169,182,192,203,216],"highly":[34],"uniform":[35],"block":[36],"structured":[37],"constraint":[38,82],"matrix.":[39],"Hemmecke,":[40],"Onn,":[41],"Romanchuk":[43],"[Math.":[44],"Program.,":[45],"2013]":[46],"showed":[47],"an":[48,94,197,210,222,286],"algorithm":[49,95,109,141,152,162,187,208,260,321],"with":[50,105,117,261],"runtime":[51],"\u0394":[52,65],"O":[53],"(":[54],"rst":[55],"+":[56],"r":[57,70],"2":[58,249],"s":[59,72],")":[60],"3":[62,246],",":[63,71,73],"where":[64],"is":[66,86,163,226],"largest":[68],"coefficient,":[69],"t":[75],"are":[76,100,131],"dimensions":[77],"blocks":[79,99],"matrix":[83],"total":[88],"dimension":[89],"IP;":[92],"thus,":[93],"efficient":[96,198],"if":[97],"small":[102,106,306],"size":[103],"coefficients.":[107],"The":[108,160],"works":[110],"iteratively":[112],"improving":[113,273],"feasible":[115],"solution":[116],"augmenting":[118,129],"steps,":[119],"IPs":[123],"have":[124,149],"special":[126],"property":[127],"that":[128,173,181,278],"steps":[130,334],"guaranteed":[132],"to":[133,214,247,285,296],"exist":[134],"not-too-large":[137],"neighborhood.":[138],"However,":[139,304],"this":[140,235],"never":[143],"been":[144],"implemented":[145,150],"evaluated.":[147],"We":[148],"learned":[154],"following":[156],"along":[157],"way.":[159],"original":[161,338],"practically":[164],"unusable,":[165],"but":[166],"we":[167,179,237,254,276],"discover":[168],"series":[170],"improvements":[172],"make":[174],"its":[175],"evaluation":[176],"possible.":[177],"Crucially,":[178],"observe":[180],"certain":[183],"constant":[184],"can":[188],"be":[189],"treated":[190],"as":[191,302],"tuning":[193,266,281],"parameter,":[194],"which":[195],"yields":[196],"heuristic":[199],"(essentially":[200],"searching":[201],"smaller-than-guaranteed":[204],"neighborhood).":[205],"Furthermore,":[206],"uses":[209],"overly":[211],"expensive":[212],"strategy":[213,329],"find":[215],"\u201cbest\u201d":[217],"step,":[218],"while":[219,315],"finding":[220,272,331],"only":[221],"\u201capproximately":[223,332],"best\u201d":[224,333],"step":[225],"much":[227],"cheaper,":[228],"yet":[229],"sufficient":[230],"for":[231,292,330],"quick":[232],"convergence.":[233],"Using":[234],"insight,":[236],"improve":[238],"asymptotic":[240],"dependence":[241],"on":[242],"from":[244],"log":[250],".":[252],"Finally,":[253],"tested":[255],"behavior":[257,314],"various":[262],"values":[263,307],"parameter":[267,282,310],"different":[269],"strategies":[270],"steps.":[274],"First,":[275],"show":[277],"decreasing":[279],"initially":[283],"leads":[284],"increased":[287],"number":[288],"iterations":[290],"needed":[291],"convergence":[293],"eventually":[295],"getting":[297],"stuck":[298],"local":[300],"optima,":[301],"expected.":[303],"surprisingly":[305],"already":[311],"exhibit":[312],"good":[313],"significantly":[316],"lowering":[317],"time":[319],"spends":[322],"per":[323],"single":[324],"iteration.":[325],"Second,":[326],"our":[327],"new":[328],"wildly":[335],"outperforms":[336],"construction.":[339]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2019-07-30T00:00:00"}