The facility location problem with general cost functions
In this paper, we introduce a generalized version of the facility location problem in which the facility cost is a function of the number of clients assigned to the facility. We focus on the case of concave facility cost functions. We observe that this problem can be reduced to the uncapacitated fac...
Gespeichert in:
| Veröffentlicht in: | Networks 2003-08, Vol.42 (1), p.42-47 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 47 |
|---|---|
| container_issue | 1 |
| container_start_page | 42 |
| container_title | Networks |
| container_volume | 42 |
| creator | Hajiaghayi, M. T. Mahdian, M. Mirrokni, V. S. |
| description | In this paper, we introduce a generalized version of the facility location problem in which the facility cost is a function of the number of clients assigned to the facility. We focus on the case of concave facility cost functions. We observe that this problem can be reduced to the uncapacitated facility location problem. We analyze a natural greedy algorithm for this problem and show that its approximation factor is at most 1.861. We also consider several generalizations and variants of this problem. © 2003 Wiley Periodicals, Inc. |
| doi_str_mv | 10.1002/net.10080 |
| format | Article |
| fullrecord | <record><control><sourceid>istex_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1002_net_10080</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>ark_67375_WNG_Z06V8WXT_7</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3700-6871745ccc978aab2d2eb6bf9d41dad3c250b3a7d697d907a9e75e5d09f681123</originalsourceid><addsrcrecordid>eNp1jz1PwzAURS0EEqUw8A-yMDCEPsdxXjyiqhSkqiyBIhbLcRxqSJPKDir596SEj4npXemde6RLyDmFKwoQTWrT7kMKB2REQWAIwPCQjPpfGjKI-TE58f4VgFJO0xER2doEpdK2sm0XVI1WrW3qYOuavDKbYGfbdfBiauNUFejGt0H5Xus94k_JUakqb86-75g83Myy6W24uJ_fTa8XoWYIECYpUoy51lpgqlQeFZHJk7wURUwLVTAdcciZwiIRWAhAJQxywwsQZZJSGrExuRy82jXeO1PKrbMb5TpJQe43y36z_NrcsxcDu1Veq6p0qtbW_xU4RBgL7LnJwO1sZbr_hXI5y37M4dCwvjUfvw3l3mSCDLlcLefyGZLHdPWUSWSfvR50Wg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The facility location problem with general cost functions</title><source>Wiley Online Library All Journals</source><creator>Hajiaghayi, M. T. ; Mahdian, M. ; Mirrokni, V. S.</creator><creatorcontrib>Hajiaghayi, M. T. ; Mahdian, M. ; Mirrokni, V. S.</creatorcontrib><description>In this paper, we introduce a generalized version of the facility location problem in which the facility cost is a function of the number of clients assigned to the facility. We focus on the case of concave facility cost functions. We observe that this problem can be reduced to the uncapacitated facility location problem. We analyze a natural greedy algorithm for this problem and show that its approximation factor is at most 1.861. We also consider several generalizations and variants of this problem. © 2003 Wiley Periodicals, Inc.</description><identifier>ISSN: 0028-3045</identifier><identifier>EISSN: 1097-0037</identifier><identifier>DOI: 10.1002/net.10080</identifier><identifier>CODEN: NTWKAA</identifier><language>eng</language><publisher>Hoboken: Wiley Subscription Services, Inc., A Wiley Company</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; approximation algorithms ; Computer science; control theory; systems ; concave facility location ; Exact sciences and technology ; facility location problem ; Flows in networks. Combinatorial problems ; generalized facility location ; Operational research and scientific management ; Operational research. Management science ; Theoretical computing</subject><ispartof>Networks, 2003-08, Vol.42 (1), p.42-47</ispartof><rights>Copyright © 2003 Wiley Periodicals, Inc.</rights><rights>2003 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3700-6871745ccc978aab2d2eb6bf9d41dad3c250b3a7d697d907a9e75e5d09f681123</citedby><cites>FETCH-LOGICAL-c3700-6871745ccc978aab2d2eb6bf9d41dad3c250b3a7d697d907a9e75e5d09f681123</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fnet.10080$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fnet.10080$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27903,27904,45553,45554</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15027497$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Hajiaghayi, M. T.</creatorcontrib><creatorcontrib>Mahdian, M.</creatorcontrib><creatorcontrib>Mirrokni, V. S.</creatorcontrib><title>The facility location problem with general cost functions</title><title>Networks</title><addtitle>Networks</addtitle><description>In this paper, we introduce a generalized version of the facility location problem in which the facility cost is a function of the number of clients assigned to the facility. We focus on the case of concave facility cost functions. We observe that this problem can be reduced to the uncapacitated facility location problem. We analyze a natural greedy algorithm for this problem and show that its approximation factor is at most 1.861. We also consider several generalizations and variants of this problem. © 2003 Wiley Periodicals, Inc.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>approximation algorithms</subject><subject>Computer science; control theory; systems</subject><subject>concave facility location</subject><subject>Exact sciences and technology</subject><subject>facility location problem</subject><subject>Flows in networks. Combinatorial problems</subject><subject>generalized facility location</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Theoretical computing</subject><issn>0028-3045</issn><issn>1097-0037</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><recordid>eNp1jz1PwzAURS0EEqUw8A-yMDCEPsdxXjyiqhSkqiyBIhbLcRxqSJPKDir596SEj4npXemde6RLyDmFKwoQTWrT7kMKB2REQWAIwPCQjPpfGjKI-TE58f4VgFJO0xER2doEpdK2sm0XVI1WrW3qYOuavDKbYGfbdfBiauNUFejGt0H5Xus94k_JUakqb86-75g83Myy6W24uJ_fTa8XoWYIECYpUoy51lpgqlQeFZHJk7wURUwLVTAdcciZwiIRWAhAJQxywwsQZZJSGrExuRy82jXeO1PKrbMb5TpJQe43y36z_NrcsxcDu1Veq6p0qtbW_xU4RBgL7LnJwO1sZbr_hXI5y37M4dCwvjUfvw3l3mSCDLlcLefyGZLHdPWUSWSfvR50Wg</recordid><startdate>200308</startdate><enddate>200308</enddate><creator>Hajiaghayi, M. T.</creator><creator>Mahdian, M.</creator><creator>Mirrokni, V. S.</creator><general>Wiley Subscription Services, Inc., A Wiley Company</general><general>John Wiley & Sons</general><scope>BSCLL</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>200308</creationdate><title>The facility location problem with general cost functions</title><author>Hajiaghayi, M. T. ; Mahdian, M. ; Mirrokni, V. S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3700-6871745ccc978aab2d2eb6bf9d41dad3c250b3a7d697d907a9e75e5d09f681123</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>approximation algorithms</topic><topic>Computer science; control theory; systems</topic><topic>concave facility location</topic><topic>Exact sciences and technology</topic><topic>facility location problem</topic><topic>Flows in networks. Combinatorial problems</topic><topic>generalized facility location</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hajiaghayi, M. T.</creatorcontrib><creatorcontrib>Mahdian, M.</creatorcontrib><creatorcontrib>Mirrokni, V. S.</creatorcontrib><collection>Istex</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>Networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hajiaghayi, M. T.</au><au>Mahdian, M.</au><au>Mirrokni, V. S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The facility location problem with general cost functions</atitle><jtitle>Networks</jtitle><addtitle>Networks</addtitle><date>2003-08</date><risdate>2003</risdate><volume>42</volume><issue>1</issue><spage>42</spage><epage>47</epage><pages>42-47</pages><issn>0028-3045</issn><eissn>1097-0037</eissn><coden>NTWKAA</coden><abstract>In this paper, we introduce a generalized version of the facility location problem in which the facility cost is a function of the number of clients assigned to the facility. We focus on the case of concave facility cost functions. We observe that this problem can be reduced to the uncapacitated facility location problem. We analyze a natural greedy algorithm for this problem and show that its approximation factor is at most 1.861. We also consider several generalizations and variants of this problem. © 2003 Wiley Periodicals, Inc.</abstract><cop>Hoboken</cop><pub>Wiley Subscription Services, Inc., A Wiley Company</pub><doi>10.1002/net.10080</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0028-3045 |
| ispartof | Networks, 2003-08, Vol.42 (1), p.42-47 |
| issn | 0028-3045 1097-0037 |
| language | eng |
| recordid | cdi_crossref_primary_10_1002_net_10080 |
| source | Wiley Online Library All Journals |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences approximation algorithms Computer science control theory systems concave facility location Exact sciences and technology facility location problem Flows in networks. Combinatorial problems generalized facility location Operational research and scientific management Operational research. Management science Theoretical computing |
| title | The facility location problem with general cost functions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T16%3A08%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-istex_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20facility%20location%20problem%20with%20general%20cost%20functions&rft.jtitle=Networks&rft.au=Hajiaghayi,%20M.%20T.&rft.date=2003-08&rft.volume=42&rft.issue=1&rft.spage=42&rft.epage=47&rft.pages=42-47&rft.issn=0028-3045&rft.eissn=1097-0037&rft.coden=NTWKAA&rft_id=info:doi/10.1002/net.10080&rft_dat=%3Cistex_cross%3Eark_67375_WNG_Z06V8WXT_7%3C/istex_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |