{"id":"https://openalex.org/W4309532044","doi":"https://doi.org/10.1109/kse56063.2022.9953774","title":"Approximation Methods for a Nonlinear Competitive Facility Cost Optimization Problem","display_name":"Approximation Methods for a Nonlinear Competitive Facility Cost Optimization Problem","publication_year":2022,"publication_date":"2022-10-19","ids":{"openalex":"https://openalex.org/W4309532044","doi":"https://doi.org/10.1109/kse56063.2022.9953774"},"language":"en","primary_location":{"id":"doi:10.1109/kse56063.2022.9953774","is_oa":false,"landing_page_url":"https://doi.org/10.1109/kse56063.2022.9953774","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 14th International Conference on Knowledge and Systems Engineering (KSE)","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/A5020523585","display_name":"Ngan Ha Duong","orcid":"https://orcid.org/0000-0002-0851-3826"},"institutions":[{"id":"https://openalex.org/I4210124651","display_name":"Phenikaa University","ror":"https://ror.org/03anxx281","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210124651"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Ngan Ha Duong","raw_affiliation_strings":["Phenikaa University,ORLab, Faculty of Computer Science,Hanoi,Vietnam","ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Phenikaa University,ORLab, Faculty of Computer Science,Hanoi,Vietnam","institution_ids":["https://openalex.org/I4210124651"]},{"raw_affiliation_string":"ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam","institution_ids":["https://openalex.org/I4210124651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019824231","display_name":"Thuy Anh Ta","orcid":"https://orcid.org/0000-0002-4849-6143"},"institutions":[{"id":"https://openalex.org/I4210124651","display_name":"Phenikaa University","ror":"https://ror.org/03anxx281","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210124651"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Thuy Anh Ta","raw_affiliation_strings":["Phenikaa University,ORLab, Faculty of Computer Science,Hanoi,Vietnam","ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Phenikaa University,ORLab, Faculty of Computer Science,Hanoi,Vietnam","institution_ids":["https://openalex.org/I4210124651"]},{"raw_affiliation_string":"ORLab, Faculty of Computer Science, Phenikaa University, Hanoi, Vietnam","institution_ids":["https://openalex.org/I4210124651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020523585"],"corresponding_institution_ids":["https://openalex.org/I4210124651"],"apc_list":null,"apc_paid":null,"fwci":0.8238,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.81887616,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10841","display_name":"Economic and Environmental Valuation","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10841","display_name":"Economic and Environmental Valuation","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.8010788559913635},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.7319778800010681},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7140570878982544},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6408075094223022},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.5554295778274536},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.48112502694129944},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4768156409263611},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.47590741515159607},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46866998076438904},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4384322464466095},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42322149872779846},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.37081730365753174},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21714776754379272}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.8010788559913635},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.7319778800010681},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7140570878982544},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6408075094223022},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.5554295778274536},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.48112502694129944},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4768156409263611},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.47590741515159607},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46866998076438904},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4384322464466095},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42322149872779846},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.37081730365753174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21714776754379272},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/kse56063.2022.9953774","is_oa":false,"landing_page_url":"https://doi.org/10.1109/kse56063.2022.9953774","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 14th International Conference on Knowledge and Systems Engineering (KSE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W123430343","https://openalex.org/W156781394","https://openalex.org/W223708877","https://openalex.org/W745466877","https://openalex.org/W1988622494","https://openalex.org/W2034504820","https://openalex.org/W2071334094","https://openalex.org/W2137344397","https://openalex.org/W2759930078","https://openalex.org/W2803781351","https://openalex.org/W2945907975","https://openalex.org/W2999769590","https://openalex.org/W3012342973","https://openalex.org/W3125133285","https://openalex.org/W4280613583","https://openalex.org/W6606411742","https://openalex.org/W6762804395","https://openalex.org/W6789880743"],"related_works":["https://openalex.org/W1973529814","https://openalex.org/W1509863433","https://openalex.org/W1991566967","https://openalex.org/W2173317315","https://openalex.org/W2810411596","https://openalex.org/W1854155592","https://openalex.org/W2499461890","https://openalex.org/W2476148062","https://openalex.org/W276709744","https://openalex.org/W4385597667"],"abstract_inverted_index":{"In":[0,50],"this":[1,51,61],"paper,":[2],"we":[3,71],"study":[4],"a":[5,11,39,45,73,92,104],"facility":[6,40],"cost":[7],"optimization":[8],"problem":[9,62,90],"in":[10],"competitive":[12],"market.":[13],"Our":[14],"objective":[15,58,78],"is":[16,63],"to":[17,22,27,41,44,68,75,87,116,125],"distribute":[18],"an":[19,29,113],"available":[20],"budget":[21],"some":[23],"newly":[24],"opened":[25],"facilities":[26],"maximize":[28],"expected":[30],"captured":[31],"customer":[32],"demand,":[33],"assuming":[34],"that":[35,56],"customers":[36],"will":[37],"select":[38],"visit":[42],"according":[43],"random":[46],"utility":[47],"maximization":[48],"model.":[49],"work,":[52],"given":[53],"the":[54,57,77,89,118,127],"fact":[55],"function":[59,79],"of":[60,129],"highly":[64],"non-convex":[65],"and":[66],"challenging":[67],"solve":[69,117],"exactly,":[70],"propose":[72],"technique":[74],"approximate":[76,119],"by":[80,103],"piece-wise":[81],"linear":[82,94],"functions,":[83],"making":[84],"it":[85],"possible":[86],"reformulate":[88],"as":[91,108],"mixed-integer":[93],"or":[95],"conic":[96],"program,":[97],"which":[98],"can":[99],"further":[100],"be":[101],"solved":[102],"commercial":[105],"solver":[106],"such":[107],"CPLEX.":[109],"We":[110],"also":[111],"explore":[112],"outer-approximation":[114],"algorithm":[115],"problem.":[120],"Computational":[121],"results":[122],"are":[123],"provided":[124],"demonstrate":[126],"performances":[128],"our":[130],"approaches.":[131]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}