{"id":"https://openalex.org/W2623145753","doi":"https://doi.org/10.1016/j.procs.2017.05.286","title":"Data Mining Approach for Feature Based Parameter Tunning for Mixed-Integer Programming Solvers","display_name":"Data Mining Approach for Feature Based Parameter Tunning for Mixed-Integer Programming Solvers","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2623145753","doi":"https://doi.org/10.1016/j.procs.2017.05.286","mag":"2623145753"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2017.05.286","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2017.05.286","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1877050917309389/pdf","source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.sciencedirect.com/science/article/pii/S1877050917309389/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058825850","display_name":"Matheus Guedes Vilas Boas","orcid":null},"institutions":[{"id":"https://openalex.org/I10824318","display_name":"Universidade Federal de Ouro Preto","ror":"https://ror.org/056s65p46","country_code":"BR","type":"education","lineage":["https://openalex.org/I10824318"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Matheus G. Vilas Boas","raw_affiliation_strings":["Federal University of Ouro Preto, Department of Computing, Ouro Preto, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Ouro Preto, Department of Computing, Ouro Preto, Brazil","institution_ids":["https://openalex.org/I10824318"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053524534","display_name":"Haroldo Gambini Santos","orcid":"https://orcid.org/0000-0002-4759-0680"},"institutions":[{"id":"https://openalex.org/I10824318","display_name":"Universidade Federal de Ouro Preto","ror":"https://ror.org/056s65p46","country_code":"BR","type":"education","lineage":["https://openalex.org/I10824318"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Haroldo G. Santos","raw_affiliation_strings":["Federal University of Ouro Preto, Department of Computing, Ouro Preto, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Ouro Preto, Department of Computing, Ouro Preto, Brazil","institution_ids":["https://openalex.org/I10824318"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069072617","display_name":"Rafael de Sousa Oliveira Martins","orcid":null},"institutions":[{"id":"https://openalex.org/I10824318","display_name":"Universidade Federal de Ouro Preto","ror":"https://ror.org/056s65p46","country_code":"BR","type":"education","lineage":["https://openalex.org/I10824318"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Rafael de S.O. Martins","raw_affiliation_strings":["Federal University of Ouro Preto, Department of Information Systems and Computing, Jo\u00e3o Monlevade, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Ouro Preto, Department of Information Systems and Computing, Jo\u00e3o Monlevade, Brazil","institution_ids":["https://openalex.org/I10824318"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028036865","display_name":"Luiz Henrique de Campos Merschmann","orcid":"https://orcid.org/0000-0002-9948-2673"},"institutions":[{"id":"https://openalex.org/I1315085146","display_name":"Universidade Federal de Lavras","ror":"https://ror.org/0122bmm03","country_code":"BR","type":"education","lineage":["https://openalex.org/I1315085146"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Luiz H.C. Merschmann","raw_affiliation_strings":["Federal University of Lavras, Department of Computer Science, Lavras, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Lavras, Department of Computer Science, Lavras, Brazil","institution_ids":["https://openalex.org/I1315085146"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028036865","https://openalex.org/A5053524534","https://openalex.org/A5058825850","https://openalex.org/A5069072617"],"corresponding_institution_ids":["https://openalex.org/I10824318","https://openalex.org/I1315085146"],"apc_list":null,"apc_paid":null,"fwci":0.2239,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.35065098,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"108","issue":null,"first_page":"715","last_page":"724"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9926000237464905,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9926000237464905,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9916999936103821,"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/T10142","display_name":"Formal Methods in Verification","score":0.9908000230789185,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8774291276931763},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7417275309562683},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6803126335144043},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6684325337409973},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6010480523109436},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5111516118049622},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49695447087287903},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.42618468403816223},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3718761205673218},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3570248484611511},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32162123918533325},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08803251385688782},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07448670268058777}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8774291276931763},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7417275309562683},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6803126335144043},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6684325337409973},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6010480523109436},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5111516118049622},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49695447087287903},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.42618468403816223},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3718761205673218},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3570248484611511},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32162123918533325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08803251385688782},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07448670268058777},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2017.05.286","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2017.05.286","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1877050917309389/pdf","source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2017.05.286","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2017.05.286","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1877050917309389/pdf","source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2623145753.pdf","grobid_xml":"https://content.openalex.org/works/W2623145753.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W272982077","https://openalex.org/W1539741229","https://openalex.org/W1689445748","https://openalex.org/W1974709582","https://openalex.org/W1980096296","https://openalex.org/W2011039300","https://openalex.org/W2048349186","https://openalex.org/W2065582221","https://openalex.org/W2068480996","https://openalex.org/W2077278144","https://openalex.org/W2081453109","https://openalex.org/W2091364465","https://openalex.org/W2122284941","https://openalex.org/W2489635168","https://openalex.org/W2489773810","https://openalex.org/W2490340839","https://openalex.org/W2962959752","https://openalex.org/W4239944110","https://openalex.org/W4240374930","https://openalex.org/W6632215170","https://openalex.org/W6722814865","https://openalex.org/W6723185222"],"related_works":["https://openalex.org/W4300001205","https://openalex.org/W2290101008","https://openalex.org/W3120050335","https://openalex.org/W1862675270","https://openalex.org/W2118661425","https://openalex.org/W2089095906","https://openalex.org/W2580320498","https://openalex.org/W2765604081","https://openalex.org/W2131251597","https://openalex.org/W2063738946"],"abstract_inverted_index":{"Integer":[0,112],"Programming":[1,113],"(IP)":[2],"is":[3,28,96],"the":[4,31,44,50,61,70,79,83,108,116,133,146,164,166,175,181],"most":[5],"successful":[6],"technique":[7],"for":[8,49,86,107,174],"solving":[9],"hard":[10],"combinatorial":[11],"optimization":[12],"problems.":[13],"Modern":[14],"IP":[15,73],"solvers":[16,74,114],"are":[17,120],"very":[18],"complex":[19],"programs":[20],"composed":[21],"of":[22,39,46,63,72,91,111,118,128,163,180,185,198],"many":[23],"different":[24,58,142],"procedures":[25,41,65],"whose":[26],"execution":[27],"embedded":[29],"in":[30,68,124,178,195],"generic":[32],"Branch":[33],"&":[34],"Bound":[35],"framework.":[36],"The":[37,154,183],"activation":[38],"these":[40,64],"as":[42],"well":[43],"definition":[45],"exploration":[47],"strategies":[48,67],"search":[51],"tree":[52],"can":[53,204],"be":[54,205],"done":[55],"by":[56,150],"setting":[57,190],"parameters.":[59],"Since":[60],"success":[62],"and":[66,145],"improving":[69],"performance":[71],"varies":[75],"widely":[76],"depending":[77],"on":[78],"problem":[80],"being":[81],"solved,":[82],"usual":[84],"approach":[85,106],"discovering":[87],"a":[88,104,125,161,186],"good":[89],"set":[90,127],"parameters":[92,173],"considering":[93],"average":[94],"results":[95,147,155],"not":[97],"ideal.":[98],"In":[99],"this":[100],"work":[101],"we":[102],"propose":[103],"comprehensive":[105],"automatic":[109],"tuning":[110],"where":[115],"characteristics":[117],"instances":[119,131,177],"considered.":[121],"Computational":[122],"experiments":[123],"diverse":[126],"308":[129],"benchmark":[130],"using":[132],"open":[134],"source":[135],"COIN-OR":[136],"CBC":[137],"solver":[138],"were":[139,148,156,168],"performed":[140],"with":[141,160,207],"parameter":[143,189],"sets":[144],"processed":[149],"data":[151],"mining":[152],"algorithms.":[153],"encouraging:":[157],"when":[158],"trained":[159],"portion":[162],"database":[165],"algorithms":[167],"able":[169],"to":[170],"predict":[171],"better":[172],"remaining":[176],"84%":[179],"cases.":[182],"selection":[184],"single":[187],"best":[188],"would":[191],"provide":[192],"an":[193],"improvement":[194],"only":[196],"56%":[197],"instances,":[199],"showing":[200],"that":[201],"great":[202],"improvements":[203],"obtained":[206],"our":[208],"approach.":[209]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}