{"id":"https://openalex.org/W4285805302","doi":"https://doi.org/10.1145/3520304.3529070","title":"A computationally fast but approximate MIP-DoM calculation for multi-objective optimization","display_name":"A computationally fast but approximate MIP-DoM calculation for multi-objective optimization","publication_year":2022,"publication_date":"2022-07-09","ids":{"openalex":"https://openalex.org/W4285805302","doi":"https://doi.org/10.1145/3520304.3529070"},"language":"en","primary_location":{"id":"doi:10.1145/3520304.3529070","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3520304.3529070","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},"type":"conference-paper","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/A5087552038","display_name":"Claudio Lucio do Val Lopes","orcid":"https://orcid.org/0000-0003-1655-2283"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Claudio L. d. V. Lopes","raw_affiliation_strings":["PPMMC, MG, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PPMMC, MG, Brazil","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086572898","display_name":"Fl\u00e1vio Vin\u00edcius Cruzeiro Martins","orcid":"https://orcid.org/0000-0002-6666-653X"},"institutions":[{"id":"https://openalex.org/I4210136482","display_name":"Federal Center for Technological Education of Minas Gerais","ror":"https://ror.org/04ch49185","country_code":"BR","type":"education","lineage":["https://openalex.org/I4210136482"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Fl\u00e1vio V. Cruzeiro Martins","raw_affiliation_strings":["CEFET-MG, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CEFET-MG, Brazil","institution_ids":["https://openalex.org/I4210136482"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074650590","display_name":"Elizabeth F. Wanner","orcid":"https://orcid.org/0000-0001-6450-3043"},"institutions":[{"id":"https://openalex.org/I4210136482","display_name":"Federal Center for Technological Education of Minas Gerais","ror":"https://ror.org/04ch49185","country_code":"BR","type":"education","lineage":["https://openalex.org/I4210136482"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Elizabeth F. Wanner","raw_affiliation_strings":["CEFET-MG, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CEFET-MG, Brazil","institution_ids":["https://openalex.org/I4210136482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088394271","display_name":"Kalyanmoy Deb","orcid":"https://orcid.org/0000-0001-7402-9939"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kalyanmoy Deb","raw_affiliation_strings":["Michigan State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Michigan State University","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"340","last_page":"343"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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/T11053","display_name":"Process Optimization and Integration","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/robustness","display_name":"Robustness (evolution)","score":0.6881375908851624},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6575504541397095},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5619764924049377},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5432180166244507},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5190525650978088},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5103573203086853},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5067036747932434},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4978182315826416},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4868120849132538},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.466399610042572},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45064812898635864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42695218324661255},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.41879117488861084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35129520297050476}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6881375908851624},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6575504541397095},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5619764924049377},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5432180166244507},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5190525650978088},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5103573203086853},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5067036747932434},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4978182315826416},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4868120849132538},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.466399610042572},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45064812898635864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42695218324661255},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.41879117488861084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35129520297050476},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3520304.3529070","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3520304.3529070","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W224959492","https://openalex.org/W2098907614","https://openalex.org/W2912436365","https://openalex.org/W2921981915","https://openalex.org/W2941114335","https://openalex.org/W2992070331","https://openalex.org/W3113526291","https://openalex.org/W4232619139"],"related_works":["https://openalex.org/W1971520370","https://openalex.org/W1997381757","https://openalex.org/W1491338215","https://openalex.org/W1536531504","https://openalex.org/W4323262350","https://openalex.org/W2082323286","https://openalex.org/W2292688905","https://openalex.org/W3125635061","https://openalex.org/W2025533503","https://openalex.org/W2062284372"],"abstract_inverted_index":{"Quality":[0],"indicators":[1],"play":[2],"an":[3,57],"essential":[4],"role":[5],"in":[6,28,36,78],"multi-":[7],"and":[8,76,124,158],"many-objective":[9],"optimization.":[10],"Dominance":[11],"move":[12,27],"(DoM)":[13],"is":[14,44,155],"a":[15,37,87,94,101,122,130],"binary":[16],"indicator":[17],"that":[18,39,152],"compares":[19],"two":[20],"solution":[21],"sets.":[22],"It":[23],"measures":[24],"the":[25,52,69,106,138,142,163],"minimum":[26],"elements":[29],"of":[30,42,51,68,71,80,108,141],"one":[31,49],"set":[32,54],"P":[33],"must":[34],"do":[35],"way":[38],"every":[40],"element":[41,50],"Q":[43],"dominated":[45],"to":[46,105,135],"at":[47],"least":[48],"moved":[53],"P'.":[55],"As":[56],"indicator,":[58],"it":[59],"presents":[60,86,129],"some":[61,116],"outstanding":[62],"characteristics":[63],"as":[64],"Pareto":[65],"compliant,":[66],"absence":[67],"use":[70],"reference":[72],"point":[73],"or":[74],"set,":[75],"robustness":[77],"terms":[79],"dominance-resistant":[81],"solutions.":[82,109],"However,":[83],"DoM":[84],"computation":[85],"combinatorial":[88,139],"nature.":[89],"A":[90],"recent":[91],"paper":[92,128],"proposes":[93],"mixed-integer":[95],"programming":[96],"model,":[97],"MIP-DoM,":[98],"which":[99],"exhibits":[100],"polynomial":[102],"computational":[103],"complexity":[104],"number":[107],"Considering":[110],"practical":[111],"situations,":[112],"its":[113],"calculation":[114],"on":[115],"problems":[117],"may":[118],"take":[119],"hours.":[120],"Using":[121],"cluster-based":[123],"divide-and-conquer":[125],"strategy,":[126],"this":[127],"computationally":[131,156],"fast":[132],"approximate":[133],"MIP-DoM":[134],"deal":[136],"with":[137],"nature":[140],"original":[143],"calculation.":[144],"Some":[145],"classical":[146],"problem":[147],"sets":[148],"are":[149],"tested,":[150],"showing":[151],"our":[153],"approach":[154],"faster":[157],"provides":[159],"accurate":[160],"estimates":[161],"for":[162],"exact":[164],"MIP-DoM.":[165]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}