{"id":"https://openalex.org/W249351555","doi":"https://doi.org/10.3990/1.9789036517874","title":"Approximation algorithms for facility location problems","display_name":"Approximation algorithms for facility location problems","publication_year":2002,"publication_date":"2002-10-04","ids":{"openalex":"https://openalex.org/W249351555","doi":"https://doi.org/10.3990/1.9789036517874","mag":"249351555"},"language":"en","primary_location":{"id":"doi:10.3990/1.9789036517874","doi":"https://doi.org/10.3990/1.9789036517874","is_oa":false,"landing_page_url":"https://doi.org/10.3990/1.9789036517874","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"University of Twente","raw_type":"dissertation"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.utwente.nl/en/publications/dd28209d-f242-4f87-a453-c0d4800c7b64","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112200228","display_name":"Adriana F. Bumb","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Adriana F. Bumb","raw_affiliation_strings":["Discrete Mathematics and Mathematical Programming"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Discrete Mathematics and Mathematical Programming","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5112200228"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9164999723434448,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9164999723434448,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.04749999940395355,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.010700000450015068,"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/facility-location","display_name":"facility location","score":0.8889999985694885},{"id":"https://openalex.org/keywords/uncapacitated-facility-location-problem","display_name":"uncapacitated facility location","score":0.8759999871253967},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9990000128746033},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.6959999799728394},{"id":"https://openalex.org/keywords/heuristics","display_name":"heuristics","score":0.7490000128746033},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.6940000057220459},{"id":"https://openalex.org/keywords/facility-opening-costs","display_name":"facility opening costs","score":0.3880000114440918}],"concepts":[{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.9417902231216431},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7936676740646362},{"id":"https://openalex.org/C50524431","wikidata":"https://www.wikidata.org/wiki/Q4545814","display_name":"1-center problem","level":3,"score":0.786267876625061},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6305358409881592},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6227714419364929},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5667989253997803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5242550373077393},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3498615324497223},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32745301723480225},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.3990/1.9789036517874","doi":"https://doi.org/10.3990/1.9789036517874","is_oa":false,"landing_page_url":"https://doi.org/10.3990/1.9789036517874","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"University of Twente","raw_type":"dissertation"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.135.8202","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.8202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://doc.utwente.nl/38644/1/t000001e.pdf","raw_type":"text"},{"id":"pmh:oai:ris.utwente.nl:openaire/dd28209d-f242-4f87-a453-c0d4800c7b64","doi":null,"is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/dd28209d-f242-4f87-a453-c0d4800c7b64","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bumb, A F 2002, 'Approximation algorithms for facility location problems', Doctor of Philosophy, University of Twente, Enschede. https://doi.org/10.3990/1.9789036517874","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/dd28209d-f242-4f87-a453-c0d4800c7b64","doi":null,"is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/approximation-algorithms-for-facility-location-problems(dd28209d-f242-4f87-a453-c0d4800c7b64).html","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralthesis"},{"id":"mag:249351555","doi":null,"is_oa":false,"landing_page_url":"https://ris.utwente.nl/ws/files/6073555/t000001e.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire/dd28209d-f242-4f87-a453-c0d4800c7b64","doi":null,"is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/dd28209d-f242-4f87-a453-c0d4800c7b64","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bumb, A F 2002, 'Approximation algorithms for facility location problems', Doctor of Philosophy, University of Twente, Enschede. https://doi.org/10.3990/1.9789036517874","raw_type":"info:eu-repo/semantics/other"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321015","display_name":"University of Twente","ror":"https://ror.org/006hf6230"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W204341840","https://openalex.org/W276709744","https://openalex.org/W1485782319","https://openalex.org/W1498382101","https://openalex.org/W1544515183","https://openalex.org/W1556911662","https://openalex.org/W1601812897","https://openalex.org/W1762430620","https://openalex.org/W1786215221","https://openalex.org/W1803694112","https://openalex.org/W1873451089","https://openalex.org/W1963547452","https://openalex.org/W1977541023","https://openalex.org/W1977577374","https://openalex.org/W1987503114","https://openalex.org/W1989289072","https://openalex.org/W2003719999","https://openalex.org/W2004660767","https://openalex.org/W2006514056","https://openalex.org/W2007855183","https://openalex.org/W2008120342","https://openalex.org/W2010410498","https://openalex.org/W2011039300","https://openalex.org/W2019628992","https://openalex.org/W2032534281","https://openalex.org/W2036265926","https://openalex.org/W2038225707","https://openalex.org/W2043943788","https://openalex.org/W2046554800","https://openalex.org/W2047276497","https://openalex.org/W2054672778","https://openalex.org/W2061594253","https://openalex.org/W2064107965","https://openalex.org/W2068871408","https://openalex.org/W2070276317","https://openalex.org/W2075910004","https://openalex.org/W2080169294","https://openalex.org/W2086917808","https://openalex.org/W2122381782","https://openalex.org/W2139841919","https://openalex.org/W2142758253","https://openalex.org/W2148352980","https://openalex.org/W2157424698","https://openalex.org/W2163196406","https://openalex.org/W2165012734","https://openalex.org/W2486715098","https://openalex.org/W2599168675","https://openalex.org/W2606195968","https://openalex.org/W2608158342","https://openalex.org/W2611804663","https://openalex.org/W2906874184","https://openalex.org/W3011766368","https://openalex.org/W3148765228"],"related_works":["https://openalex.org/W1580058724","https://openalex.org/W2000500966","https://openalex.org/W1595318379","https://openalex.org/W1552784696","https://openalex.org/W2181735406","https://openalex.org/W2106850014","https://openalex.org/W2235001037","https://openalex.org/W7095504507","https://openalex.org/W2917390388","https://openalex.org/W2574266776"],"abstract_inverted_index":{"Facility":[0],"location":[1,19],"problems":[2,8],"are":[3,31],"among":[4],"the":[5,16,25,28,58,61,65,68,106],"most":[6],"well-studied":[7],"in":[9],"optimization":[10],"literature.":[11],"The":[12,44],"simplest":[13],"variant":[14],"is":[15,79,83],"uncapacitated":[17],"facility":[18,37,78],"problem,":[20],"which":[21],"we":[22,30,98],"denoted":[23],"by":[24],"UFLP.":[26,107],"In":[27,95],"UFLP,":[29],"given":[32],"a":[33,40,49],"set":[34,41,50],"of":[35,42,51,60,63,70,105],"possible":[36],"locations":[38,52],"and":[39,67],"clients.":[43],"problem":[45,82],"seeks":[46],"to":[47,53],"find":[48],"build/open":[54],"facilities":[55,66],"such":[56],"that":[57],"sum":[59],"cost":[62,69],"building/opening":[64],"serving":[71],"each":[72],"client":[73],"from":[74],"exactly":[75],"one":[76],"open":[77],"minimized.":[80],"This":[81],"NP\u2212hard.":[84],"Therefore,":[85],"many":[86],"heuristics":[87],"for":[88,102],"finding":[89],"good":[90],"approximate":[91],"solutions":[92],"were":[93],"developed.":[94],"this":[96],"thesis":[97],"design":[99],"approximation":[100],"algorithms":[101],"several":[103],"variants":[104]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2016-06-24T00:00:00"}