{"id":"https://openalex.org/W646362167","doi":null,"title":"A Face Optimization Algorithm for Optimizing over the Efficient Set","display_name":"A Face Optimization Algorithm for Optimizing over the Efficient Set","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W646362167","mag":"646362167"},"language":"en","primary_location":{"id":"mag:2254788448","doi":null,"is_oa":false,"landing_page_url":"http://www.dbpia.co.kr/Journal/ArticleDetail/NODE00310823","pdf_url":null,"source":{"id":"https://openalex.org/S4306493933","display_name":"\uacbd\uc601\uacfc\ud559","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\uacbd\uc601\uacfc\ud559","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5033416600","display_name":"Dong-Yeop Kim","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\uae40\ub3d9\uc5fd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5104356702","display_name":"Tae-Ho Ahn","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\uc548\ud0dc\ud638","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"1","first_page":"77","last_page":"85"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.5562000274658203,"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"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.5562000274658203,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.3384000062942505,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.04149999842047691,"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/efficient-set","display_name":"efficient set","score":0.8740000128746033},{"id":"https://openalex.org/keywords/multi-objective-linear-programming","display_name":"multi-objective linear programming","score":0.9300000071525574},{"id":"https://openalex.org/keywords/global-optimization","display_name":"global optimization","score":0.9309999942779541},{"id":"https://openalex.org/keywords/nonconvex-sets","display_name":"nonconvex sets","score":0.8159999847412109},{"id":"https://openalex.org/keywords/exact-optimal-solution","display_name":"exact optimal solution","score":0.6700000166893005}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6914804577827454},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.672006368637085},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.6339884996414185},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6011489033699036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47413158416748047},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4725874364376068},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.44593361020088196},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4414098858833313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44052428007125854},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4315168261528015},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C36289849","wikidata":"https://www.wikidata.org/wiki/Q34749","display_name":"Social science","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2254788448","doi":null,"is_oa":false,"landing_page_url":"http://www.dbpia.co.kr/Journal/ArticleDetail/NODE00310823","pdf_url":null,"source":{"id":"https://openalex.org/S4306493933","display_name":"\uacbd\uc601\uacfc\ud559","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\uacbd\uc601\uacfc\ud559","raw_type":null},{"id":"mag:646362167","doi":null,"is_oa":false,"landing_page_url":"http://www.koreascience.or.kr/article/ArticleFullRecord.jsp?cn=GOGGCJ_1998_v15n1_77","pdf_url":null,"source":{"id":"https://openalex.org/S4306517766","display_name":"Korean Management Science Review","issn_l":"1225-1100","issn":["1225-1100","2765-5687"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Korean Management Science Review","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W646143342","https://openalex.org/W2024003784","https://openalex.org/W2148095990","https://openalex.org/W2019344905","https://openalex.org/W2132732693","https://openalex.org/W2039997330","https://openalex.org/W2093807570","https://openalex.org/W1588473452","https://openalex.org/W2171592970","https://openalex.org/W1984028315"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"a":[3,16,26,38,47,103],"face":[4],"optimization":[5,49],"algorithm":[6,82],"is":[7,35,87],"developed":[8],"for":[9,83,99],"solving":[10,78,84],"the":[11,20,32,70,100],"problem":[12,41,65,79,85,101],"(P)":[13,42,66,86],"of":[14,22,25,69,106],"optimizing":[15],"linear":[17,29],"function":[18],"over":[19],"set":[21,34],"efficient":[23,33],"solutions":[24],"multiple":[27],"objective":[28],"program.":[30],"Since":[31],"in":[36,67,102],"general":[37],"nonconvex":[39],"set,":[40],"can":[43,74],"be":[44,75],"classified":[45],"as":[46],"global":[48],"problem.":[50],"Perhaps":[51],"due":[52],"to":[53,63,89],"its":[54],"inherent":[55],"difficulty,":[56],"relatively":[57],"few":[58],"attempts":[59],"have":[60],"been":[61],"made":[62],"solve":[64],"spite":[68],"potential":[71],"benefits":[72],"which":[73],"obtained":[76],"by":[77],"(P).":[80],"The":[81],"guaranteed":[88],"find":[90],"an":[91],"exact":[92,96],"optimal":[93,97],"or":[94],"almost":[95],"solution":[98],"finite":[104],"number":[105],"iterations.":[107]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}