{"id":"https://openalex.org/W2128330915","doi":"https://doi.org/10.1109/cec.2011.5949847","title":"A new evolutionary approach to minimax problems","display_name":"A new evolutionary approach to minimax problems","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2128330915","doi":"https://doi.org/10.1109/cec.2011.5949847","mag":"2128330915"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2011.5949847","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949847","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"article","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/A5081542613","display_name":"Rodica Ioana Lung","orcid":"https://orcid.org/0000-0002-5572-8141"},"institutions":[{"id":"https://openalex.org/I3125347698","display_name":"Babe\u0219-Bolyai University","ror":"https://ror.org/02rmd1t30","country_code":"RO","type":"education","lineage":["https://openalex.org/I3125347698"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Rodica Ioana Lung","raw_affiliation_strings":["Faculty of Economics and Business Administration, Babe\u015f-Bolyai University, Cluj-Napoca, Romania","Babe\u015f-Bolyai University of Cluj Napoca, Faculty of Economics and Business Administration, Cluj Napoca, Romania"],"affiliations":[{"raw_affiliation_string":"Faculty of Economics and Business Administration, Babe\u015f-Bolyai University, Cluj-Napoca, Romania","institution_ids":["https://openalex.org/I3125347698"]},{"raw_affiliation_string":"Babe\u015f-Bolyai University of Cluj Napoca, Faculty of Economics and Business Administration, Cluj Napoca, Romania","institution_ids":["https://openalex.org/I3125347698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110172528","display_name":"D. Dumitrescu","orcid":"https://orcid.org/0000-0001-8958-1777"},"institutions":[{"id":"https://openalex.org/I3125347698","display_name":"Babe\u0219-Bolyai University","ror":"https://ror.org/02rmd1t30","country_code":"RO","type":"education","lineage":["https://openalex.org/I3125347698"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"D. Dumitrescu","raw_affiliation_strings":["Faculty of Economics and Business Administration, Babe\u015f-Bolyai University, Cluj-Napoca, Romania","Babe\u015f-Bolyai University of Cluj Napoca, Center for the Study of Complexity, Cluj Napoca, Romania"],"affiliations":[{"raw_affiliation_string":"Faculty of Economics and Business Administration, Babe\u015f-Bolyai University, Cluj-Napoca, Romania","institution_ids":["https://openalex.org/I3125347698"]},{"raw_affiliation_string":"Babe\u015f-Bolyai University of Cluj Napoca, Center for the Study of Complexity, Cluj Napoca, Romania","institution_ids":["https://openalex.org/I3125347698"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081542613"],"corresponding_institution_ids":["https://openalex.org/I3125347698"],"apc_list":null,"apc_paid":null,"fwci":2.1379,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.89162329,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"iii","issue":null,"first_page":"1902","last_page":"1905"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.993399977684021,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.993399977684021,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9909999966621399,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9855999946594238,"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/minimax","display_name":"Minimax","score":0.9360846281051636},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.7116962671279907},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.648732602596283},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5383155941963196},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4949731230735779},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49183201789855957},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.48888057470321655},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.45745694637298584},{"id":"https://openalex.org/keywords/minimax-approximation-algorithm","display_name":"Minimax approximation algorithm","score":0.43602511286735535},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4144720137119293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40881091356277466},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.36912405490875244}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.9360846281051636},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.7116962671279907},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.648732602596283},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5383155941963196},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4949731230735779},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49183201789855957},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.48888057470321655},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.45745694637298584},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.43602511286735535},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4144720137119293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40881091356277466},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.36912405490875244},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2011.5949847","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2011.5949847","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Congress of Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1546149211","https://openalex.org/W1599092080","https://openalex.org/W2017258920","https://openalex.org/W2028589351","https://openalex.org/W2056270382","https://openalex.org/W2114822196","https://openalex.org/W2123006010","https://openalex.org/W2136954673","https://openalex.org/W2153864050"],"related_works":["https://openalex.org/W2007611377","https://openalex.org/W2014708116","https://openalex.org/W2332878920","https://openalex.org/W2085446381","https://openalex.org/W149398686","https://openalex.org/W2014628290","https://openalex.org/W2236801283","https://openalex.org/W2033135368","https://openalex.org/W2047800014","https://openalex.org/W2111030377"],"abstract_inverted_index":{"Minimax":[0],"or":[1],"worst-case":[2],"optimization":[3],"is":[4],"concerned":[5],"with":[6,77],"the":[7,10,33,36,44,47,51,55,58],"minimization":[8],"of":[9,16,39,46,57],"maximum":[11],"output":[12],"in":[13,26],"all":[14],"scenarios":[15],"a":[17,27,65],"given":[18],"problem.":[19,49],"The":[20],"minimax":[21,85],"problem":[22],"can":[23,60],"be":[24,61],"transformed":[25],"two":[28],"players":[29],"zero-sum":[30],"game":[31,41,59],"considering":[32],"fact":[34],"that":[35],"Nash":[37,52],"equilibria":[38,56],"this":[40,73],"would":[42],"represent":[43],"solution":[45],"original":[48],"Using":[50],"ascendancy":[53],"relation":[54],"directly":[62],"computed":[63],"using":[64,72],"differential":[66],"evolution":[67],"algorithm.":[68],"Results":[69],"obtained":[70],"by":[71],"approach":[74],"are":[75],"compared":[76],"best":[78],"known":[79],"results":[80],"from":[81],"literature":[82],"on":[83],"six":[84],"benchmark":[86],"problems.":[87]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}