{"id":"https://openalex.org/W2294282916","doi":"https://doi.org/10.1007/978-3-319-28678-5_12","title":"Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem","display_name":"Deterministic Algorithm for 1-Median 1-Center Two-Objective Optimization Problem","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2294282916","doi":"https://doi.org/10.1007/978-3-319-28678-5_12","mag":"2294282916"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-28678-5_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-28678-5_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://inria.hal.science/hal-01446259","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019685276","display_name":"Vahid Roostapour","orcid":"https://orcid.org/0000-0002-8896-9590"},"institutions":[{"id":"https://openalex.org/I161028277","display_name":"Institute for Advanced Studies in Basic Sciences","ror":"https://ror.org/00bzsst90","country_code":"IR","type":"education","lineage":["https://openalex.org/I161028277"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Vahid Roostapour","raw_affiliation_strings":["Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran","institution_ids":["https://openalex.org/I161028277"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069261507","display_name":"Iman Kiarazm","orcid":null},"institutions":[{"id":"https://openalex.org/I161028277","display_name":"Institute for Advanced Studies in Basic Sciences","ror":"https://ror.org/00bzsst90","country_code":"IR","type":"education","lineage":["https://openalex.org/I161028277"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Iman Kiarazm","raw_affiliation_strings":["Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran","institution_ids":["https://openalex.org/I161028277"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065062849","display_name":"Mansoor Davoodi","orcid":"https://orcid.org/0000-0003-1010-4121"},"institutions":[{"id":"https://openalex.org/I161028277","display_name":"Institute for Advanced Studies in Basic Sciences","ror":"https://ror.org/00bzsst90","country_code":"IR","type":"education","lineage":["https://openalex.org/I161028277"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mansoor Davoodi","raw_affiliation_strings":["Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran","institution_ids":["https://openalex.org/I161028277"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019685276"],"corresponding_institution_ids":["https://openalex.org/I161028277"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":5.0641,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.94950565,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"164","last_page":"178"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9998999834060669,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.996399998664856,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.7636495232582092},{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.6109973788261414},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.5781521201133728},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5338621735572815},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5294681787490845},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5253471732139587},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.49647432565689087},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4756474196910858},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4598051607608795},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.44220292568206787},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4352377653121948},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4304599165916443},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42127954959869385},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3565910756587982},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21433085203170776},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12796196341514587},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0877101719379425}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.7636495232582092},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.6109973788261414},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5781521201133728},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5338621735572815},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5294681787490845},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5253471732139587},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.49647432565689087},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4756474196910858},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4598051607608795},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.44220292568206787},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4352377653121948},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4304599165916443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42127954959869385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3565910756587982},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21433085203170776},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12796196341514587},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0877101719379425},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-28678-5_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-28678-5_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-01446259v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01446259","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.164-178, ⟨10.1007/978-3-319-28678-5_12⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01446259v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01446259","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.164-178, ⟨10.1007/978-3-319-28678-5_12⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W42649658","https://openalex.org/W1505807419","https://openalex.org/W1595498733","https://openalex.org/W1928381443","https://openalex.org/W1977263019","https://openalex.org/W1977983731","https://openalex.org/W1988106539","https://openalex.org/W2003207175","https://openalex.org/W2004931706","https://openalex.org/W2006514056","https://openalex.org/W2023770210","https://openalex.org/W2043869641","https://openalex.org/W2045964207","https://openalex.org/W2059651397","https://openalex.org/W2068769655","https://openalex.org/W2073583237","https://openalex.org/W2085751730","https://openalex.org/W2096691794","https://openalex.org/W2114303587","https://openalex.org/W2114493937","https://openalex.org/W2133962824","https://openalex.org/W2147670675","https://openalex.org/W4285719527","https://openalex.org/W4292408320"],"related_works":["https://openalex.org/W2090178682","https://openalex.org/W2001591765","https://openalex.org/W4241467429","https://openalex.org/W2073147994","https://openalex.org/W1588199609","https://openalex.org/W2384474142","https://openalex.org/W1550055091","https://openalex.org/W2744462909","https://openalex.org/W3083133203","https://openalex.org/W1971520370"],"abstract_inverted_index":{"k":[0,3],"-median":[1],"and":[2,23,86,106,132],"-center":[4],"are":[5],"two":[6,75,107],"well-known":[7],"problems":[8,34],"in":[9,17,57,69,104,109,136],"facility":[10],"location":[11],"which":[12,127],"play":[13],"an":[14],"important":[15],"role":[16],"operation":[18],"research,":[19],"management":[20],"science,":[21],"clustering":[22],"computational":[24],"geometry.":[25],"To":[26],"the":[27,70,115,129],"best":[28],"of":[29,37,60,72,117],"our":[30],"knowledge,":[31],"although":[32],"these":[33],"have":[35,40],"lots":[36],"applications,":[38],"they":[39],"never":[41],"been":[42,55],"studied":[43],"together":[44],"simultaneously":[45],"as":[46],"a":[47,98,124],"multi":[48],"objective":[49],"optimization":[50,53,89],"problem.":[51,90],"Multi-objective":[52],"has":[54],"applied":[56],"many":[58],"fields":[59],"science":[61],"where":[62],"optimal":[63],"decisions":[64],"need":[65],"to":[66],"be":[67],"taken":[68],"presence":[71],"trade-offs":[73],"between":[74],"or":[76],"more":[77],"conflicting":[78],"objectives.":[79],"In":[80],"this":[81],"paper":[82],"we":[83,122],"consider":[84],"1-median":[85],"1-center":[87],"two-objective":[88],"We":[91],"prove":[92],"that":[93],"$$\\varOmega":[94],"(n\\log":[95],"{n})$$":[96,139],"is":[97],"lower":[99],"bound":[100],"for":[101],"proposed":[102],"problem":[103],"one":[105],"dimensions":[108],"Manhattan":[110],"metric.":[111],"Also,":[112],"by":[113],"using":[114],"properties":[116],"farthest":[118],"point":[119],"Voronoi":[120],"diagram,":[121],"present":[123],"deterministic":[125],"algorithm":[126],"output":[128],"Pareto":[130,133],"Front":[131],"Optimal":[134],"Solutions":[135],"$$\\mathcal":[137],"{O}(n\\log":[138],"time.":[140]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}