{"id":"https://openalex.org/W2496655597","doi":"https://doi.org/10.1145/2908812.2908951","title":"A Faster Algorithm for the Binary Epsilon Indicator Based on Orthant Minimum Search","display_name":"A Faster Algorithm for the Binary Epsilon Indicator Based on Orthant Minimum Search","publication_year":2016,"publication_date":"2016-07-20","ids":{"openalex":"https://openalex.org/W2496655597","doi":"https://doi.org/10.1145/2908812.2908951","mag":"2496655597"},"language":"en","primary_location":{"id":"doi:10.1145/2908812.2908951","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2908812.2908951","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2908812.2908951?download=true","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2908812.2908951?download=true","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012710237","display_name":"Andrey Vasin","orcid":"https://orcid.org/0000-0002-2384-7090"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Andrey Vasin","raw_affiliation_strings":["ITMO University, Saint Petersburg, Russian Fed"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University, Saint Petersburg, Russian Fed","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062797646","display_name":"Maxim Buzdalov","orcid":"https://orcid.org/0000-0002-7120-8824"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Maxim Buzdalov","raw_affiliation_strings":["ITMO University, Saint Petersburg, Russian Fed"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University, Saint Petersburg, Russian Fed","institution_ids":["https://openalex.org/I173089394"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I173089394"],"apc_list":null,"apc_paid":null,"fwci":0.6203,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.58801428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"613","last_page":"620"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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/T11798","display_name":"Optimal Experimental Design Methods","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9901999831199646,"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/binary-number","display_name":"Binary number","score":0.7258630990982056},{"id":"https://openalex.org/keywords/orthant","display_name":"Orthant","score":0.7053346633911133},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5997195839881897},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4891796410083771},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4890514314174652},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48664793372154236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44997626543045044},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.4488997459411621},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.28926581144332886},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23867392539978027},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.055551677942276},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.05477604269981384}],"concepts":[{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.7258630990982056},{"id":"https://openalex.org/C2780016784","wikidata":"https://www.wikidata.org/wiki/Q2714507","display_name":"Orthant","level":2,"score":0.7053346633911133},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5997195839881897},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4891796410083771},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4890514314174652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48664793372154236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44997626543045044},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4488997459411621},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.28926581144332886},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23867392539978027},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.055551677942276},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.05477604269981384},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2908812.2908951","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2908812.2908951","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2908812.2908951?download=true","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2908812.2908951","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2908812.2908951","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2908812.2908951?download=true","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference 2016","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2496655597.pdf","grobid_xml":"https://content.openalex.org/works/W2496655597.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1513507088","https://openalex.org/W1570937420","https://openalex.org/W1588375755","https://openalex.org/W1613794742","https://openalex.org/W1979109797","https://openalex.org/W2028772559","https://openalex.org/W2066354072","https://openalex.org/W2090747326","https://openalex.org/W2098907614","https://openalex.org/W2106334424","https://openalex.org/W2108968575","https://openalex.org/W2117852087","https://openalex.org/W2126997347","https://openalex.org/W2144982506","https://openalex.org/W2148615815","https://openalex.org/W2270633462","https://openalex.org/W3037787799"],"related_works":["https://openalex.org/W2382626982","https://openalex.org/W2376716665","https://openalex.org/W1495725930","https://openalex.org/W1525838894","https://openalex.org/W2110562615","https://openalex.org/W4295363057","https://openalex.org/W1988575180","https://openalex.org/W2352621013","https://openalex.org/W1522863580","https://openalex.org/W2141208293"],"abstract_inverted_index":{"The":[0],"binary":[1],"\u03b5-indicator":[2,81],"is":[3,22,44,50,63,83],"often":[4],"used":[5],"to":[6,16,52],"assess":[7],"the":[8,35,40,45,59,71,80],"quality":[9],"of":[10,37,47,77],"solutions":[11,38],"in":[12,39],"multiobjective":[13],"optimization,":[14],"and":[15,32,42,91],"perform":[17],"optimization":[18],"as":[19],"well.":[20],"It":[21],"normally":[23],"evaluated":[24],"using":[25],"a":[26],"straightforward":[27],"\u03b8(nmk)":[28],"algorithm,":[29],"where":[30],"n":[31],"m":[33],"are":[34,67],"number":[36,46],"arguments,":[41],"k":[43],"objectives.":[48],"This":[49],"considered":[51],"be":[53],"fast":[54],"compared":[55],"to,":[56],"for":[57,70,74,87,92],"example,":[58],"hypervolume":[60],"indicator,":[61],"which":[62],"#P-hard.":[64],"However,":[65],"there":[66],"efficient":[68],"algorithms":[69],"latter,":[72],"especially":[73],"small":[75],"values":[76],"k,":[78],"while":[79],"evaluation":[82],"too":[84],"slow":[85],"already":[86],"n,m":[88],">":[89],"104":[90],"any":[93],"k.":[94]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}