Primal–dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
The main contribution of this work is to propose a primal–dual combinatorial 3(1+ε)-approximation algorithm for the two-level facility location problem (2-LFLP) by exploring the approximation oracle concept. This result improves the previous primal–dual 6-approximation algorithm for the multilevel f...
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 562; s. 213 - 226 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
2015
|
| Témata: | |
| ISSN: | 0304-3975, 1879-2294 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The main contribution of this work is to propose a primal–dual combinatorial 3(1+ε)-approximation algorithm for the two-level facility location problem (2-LFLP) by exploring the approximation oracle concept. This result improves the previous primal–dual 6-approximation algorithm for the multilevel facility location problem, and also matches the previous primal–dual approximation ratio for the single-level facility location problem. One of the major merits of primal–dual type algorithms is their easy adaption to other variants of the facility location problems. As a demonstration, our primal–dual approximation algorithm can be easily adapted to several variants of the 2-LFLP, including models with stochastic scenario, dynamically arrived demands, and linear facility cost. |
|---|---|
| AbstractList | The main contribution of this work is to propose a primal-dual combinatorial -approximation algorithm for the two-level facility location problem (2-LFLP) by exploring the approximation oracle concept. This result improves the previous primal-dual 6-approximation algorithm for the multilevel facility location problem, and also matches the previous primal-dual approximation ratio for the single-level facility location problem. One of the major merits of primal-dual type algorithms is their easy adaption to other variants of the facility location problems. As a demonstration, our primal-dual approximation algorithm can be easily adapted to several variants of the 2-LFLP, including models with stochastic scenario, dynamically arrived demands, and linear facility cost. The main contribution of this work is to propose a primal–dual combinatorial 3(1+ε)-approximation algorithm for the two-level facility location problem (2-LFLP) by exploring the approximation oracle concept. This result improves the previous primal–dual 6-approximation algorithm for the multilevel facility location problem, and also matches the previous primal–dual approximation ratio for the single-level facility location problem. One of the major merits of primal–dual type algorithms is their easy adaption to other variants of the facility location problems. As a demonstration, our primal–dual approximation algorithm can be easily adapted to several variants of the 2-LFLP, including models with stochastic scenario, dynamically arrived demands, and linear facility cost. |
| Author | Wu, Chenchen Du, Donglei Xu, Dachuan |
| Author_xml | – sequence: 1 givenname: Chenchen surname: Wu fullname: Wu, Chenchen email: wuchenchen@emails.bjut.edu.cn organization: College of Science, Tianjin University of Technology, Tianjin 300384, PR China – sequence: 2 givenname: Donglei surname: Du fullname: Du, Donglei email: ddu@unb.ca organization: Faculty of Business Administration, University of New Brunswick, Fredericton, NB E3B 5A3, Canada – sequence: 3 givenname: Dachuan surname: Xu fullname: Xu, Dachuan email: xudc@bjut.edu.cn organization: College of Applied Sciences, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing 100124, PR China |
| BookMark | eNp9kMFu1DAQhi1UJLaFB-DmI5eEcewka3FCFRSkSuUAZ2viTLpeeeOt7V3YW9-BN-RJ8DacONSXkaz_-0fzXbKLOczE2FsBtQDRvd_W2aa6AaFq0DWo9gVbiXWvq6bR6oKtQIKqpO7bV-wypS2U1_bdisVv0e3Q_3n8PR7Qc9zvY_hVfrILM0d_H6LLmx2fQuR5Qzz_DJWnI3k-oXXe5RP3wS7pQg6edvzokCN_qns4YHLVfSQaT0s32s1r9nJCn-jNv3nFfnz-9P36S3V7d_P1-uNtZaWEXLUghkaibgkRxnboCHu5Ri1JNLZDO1jRwqS7bsCpHSY9jqQ1rZWapOqVHOUVe7f0lrUPB0rZ7Fyy5D3OFA7JiK4DULIFKFGxRG0MKUWazP6sJZ6MAHP2a7am-DVnvwa0KX4L0__HWJefTOSIzj9LflhIKtcfHUWTrKPZ0ugi2WzG4J6h_wJQG5tU |
| CitedBy_id | crossref_primary_10_1007_s10878_016_0064_2 crossref_primary_10_1007_s10898_017_0566_1 crossref_primary_10_1007_s11590_015_0989_x |
| Cites_doi | 10.1016/S0167-6377(03)00062-2 10.1145/950620.950621 10.1016/j.dam.2009.11.007 10.1287/opre.1040.0140 10.1016/j.tcs.2007.05.024 10.1137/070708901 10.1137/S0097539703405754 10.1016/S0020-0190(99)00144-1 10.1137/S0097539703435716 10.1006/jagm.1998.0993 10.1287/moor.1040.0125 10.1145/375827.375845 10.1137/S0097539701398594 10.1007/s10107-005-0673-5 10.1007/s00453-007-9032-7 10.1016/S0167-6377(02)00183-9 10.1137/S0895480102417215 10.1016/j.orl.2010.04.010 10.1016/j.ic.2012.01.007 10.1007/s10107-006-0704-x |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier B.V. |
| Copyright_xml | – notice: 2014 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.tcs.2014.09.045 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 226 |
| ExternalDocumentID | 10_1016_j_tcs_2014_09_045 S030439751400735X |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c330t-501b23a95eaa0d5b6ea738a93e12c6acbc150f966baf5bf9dde99e844f34743d3 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000347602000016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Mon Sep 29 06:25:39 EDT 2025 Sat Nov 29 05:15:18 EST 2025 Tue Nov 18 20:00:22 EST 2025 Fri Feb 23 02:30:25 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Facility location problem Approximation algorithm Primal–dual algorithm |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c330t-501b23a95eaa0d5b6ea738a93e12c6acbc150f966baf5bf9dde99e844f34743d3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2014.09.045 |
| PQID | 1660043500 |
| PQPubID | 23500 |
| PageCount | 14 |
| ParticipantIDs | proquest_miscellaneous_1660043500 crossref_primary_10_1016_j_tcs_2014_09_045 crossref_citationtrail_10_1016_j_tcs_2014_09_045 elsevier_sciencedirect_doi_10_1016_j_tcs_2014_09_045 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-00-00 |
| PublicationDateYYYYMMDD | 2015-01-01 |
| PublicationDate_xml | – year: 2015 text: 2015-00-00 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Zhang (br0290) 2006; 108 Vazirani (br0260) 2001 Byrka, Rybicki (br0050) 2012 Shmoys, Tardös, Aardal (br0210) 1997 Aardal, Chudak, Shmoys (br0010) 1999; 72 Sviridenko (br0250) 2004; 32 Zhang, Chen, Ye (br0300) 2005; 30 Krishnaswamy, Sviridenko (br0160) 2012 Sviridenko (br0240) 2002 Ageev, Ye, Zhang (br0020) 2004; 18 Byrka, Aardal (br0040) 2010; 39 Zhang (br0320) 2007; 384 Shu, Teo, Shen (br0220) 2005; 53 Bumb, Kern (br0030) 2001 Chen, Chen (br0080) 2007; 53 Wang, Du, Gabor, Xu (br0270) 2010; 38 Ravi, Sinha (br0200) 2006; 108 Jain, Vazirani (br0150) 2001; 48 July 1998. Jain, Mahdian, Markakis, Saberi, Vazirani (br0140) 2003; 50 Grotschel, Lovasz, Shrijver (br0120) 1988 Guha, Khuller (br0130) 1999; 31 M. Sviridenko, cited as personal communication in Charikar, Khuller, Mount, Naraasimban (br0070) 2001 Li (br0170) 2013; 222 Zhang, Ye (br0310) 2002; 30 Ye, Zhang (br0280) 2005 Gabor, van Ommeren (br0110) 2010; 158 Mahdian (br0180) 2004 Charikar, Guha (br0060) 2005; 34 Mahdian, Ye, Zhang (br0190) 2006; 36 Edwards (br0100) 2001 Chudak, Shmoys (br0090) 2003; 33 Charikar (10.1016/j.tcs.2014.09.045_br0070) 2001 Byrka (10.1016/j.tcs.2014.09.045_br0050) 2012 Li (10.1016/j.tcs.2014.09.045_br0170) 2013; 222 Ravi (10.1016/j.tcs.2014.09.045_br0200) 2006; 108 Ye (10.1016/j.tcs.2014.09.045_br0280) 2005 Jain (10.1016/j.tcs.2014.09.045_br0150) 2001; 48 Grotschel (10.1016/j.tcs.2014.09.045_br0120) 1988 Edwards (10.1016/j.tcs.2014.09.045_br0100) 2001 Mahdian (10.1016/j.tcs.2014.09.045_br0180) 2004 Zhang (10.1016/j.tcs.2014.09.045_br0300) 2005; 30 Vazirani (10.1016/j.tcs.2014.09.045_br0260) 2001 Zhang (10.1016/j.tcs.2014.09.045_br0290) 2006; 108 Wang (10.1016/j.tcs.2014.09.045_br0270) 2010; 38 Krishnaswamy (10.1016/j.tcs.2014.09.045_br0160) 2012 Shu (10.1016/j.tcs.2014.09.045_br0220) 2005; 53 Zhang (10.1016/j.tcs.2014.09.045_br0310) 2002; 30 Ageev (10.1016/j.tcs.2014.09.045_br0020) 2004; 18 Jain (10.1016/j.tcs.2014.09.045_br0140) 2003; 50 Byrka (10.1016/j.tcs.2014.09.045_br0040) 2010; 39 Mahdian (10.1016/j.tcs.2014.09.045_br0190) 2006; 36 Shmoys (10.1016/j.tcs.2014.09.045_br0210) 1997 Zhang (10.1016/j.tcs.2014.09.045_br0320) 2007; 384 10.1016/j.tcs.2014.09.045_br0230 Chen (10.1016/j.tcs.2014.09.045_br0080) 2007; 53 Chudak (10.1016/j.tcs.2014.09.045_br0090) 2003; 33 Sviridenko (10.1016/j.tcs.2014.09.045_br0250) 2004; 32 Guha (10.1016/j.tcs.2014.09.045_br0130) 1999; 31 Sviridenko (10.1016/j.tcs.2014.09.045_br0240) 2002 Aardal (10.1016/j.tcs.2014.09.045_br0010) 1999; 72 Charikar (10.1016/j.tcs.2014.09.045_br0060) 2005; 34 Bumb (10.1016/j.tcs.2014.09.045_br0030) 2001 Gabor (10.1016/j.tcs.2014.09.045_br0110) 2010; 158 |
| References_xml | – year: 2001 ident: br0100 article-title: Approximation algorithms for the multi-level facility location problem – volume: 30 start-page: 389 year: 2005 end-page: 403 ident: br0300 article-title: A multiexchange local search algorithm for the capacitated facility location problem publication-title: Math. Oper. Res. – year: 2001 ident: br0260 article-title: Approximation Algorithms – volume: 31 start-page: 228 year: 1999 end-page: 248 ident: br0130 article-title: Greedy strike back: improved facility location algorithms publication-title: J. Algorithms – volume: 108 start-page: 97 year: 2006 end-page: 114 ident: br0200 article-title: Hedging uncertainty: approximation algorithms for stochastic optimization problems publication-title: Math. Program., Ser. A – volume: 39 start-page: 2212 year: 2010 end-page: 2231 ident: br0040 article-title: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem publication-title: SIAM J. Comput. – volume: 72 start-page: 161 year: 1999 end-page: 167 ident: br0010 article-title: A 3-approximation algorithm for the publication-title: Inform. Process. Lett. – start-page: 157 year: 2012 end-page: 169 ident: br0050 article-title: Improved LP-rounding approximation algorithm for publication-title: Proceedings of ICALP – volume: 384 start-page: 126 year: 2007 end-page: 135 ident: br0320 article-title: A new approximation algorithm for the publication-title: Theoret. Comput. Sci. – volume: 222 start-page: 45 year: 2013 end-page: 58 ident: br0170 article-title: A 1.488-approximation algorithm for the uncapacitated facility location problem publication-title: Inform. and Comput. – volume: 30 start-page: 333 year: 2002 end-page: 335 ident: br0310 article-title: A note on the maximization version of the multi-level facility location problem publication-title: Oper. Res. Lett. – reference: , July 1998. – volume: 50 start-page: 795 year: 2003 end-page: 824 ident: br0140 article-title: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP publication-title: J. ACM – start-page: 718 year: 2012 end-page: 734 ident: br0160 article-title: Inapproximability of the multilevel uncapacitated facility location problem publication-title: Proceedings of SODA – volume: 108 start-page: 159 year: 2006 end-page: 176 ident: br0290 article-title: Approximating the two-level facility location problem via a quasi-greedy approach publication-title: Math. Program., Ser. A – start-page: 55 year: 2001 end-page: 63 ident: br0030 article-title: A simple dual ascent algorithm for the multilevel facility location problem publication-title: Proceedings of APPROX – volume: 53 start-page: 48 year: 2005 end-page: 60 ident: br0220 article-title: Stochastic transportation-inventory network design problem publication-title: Oper. Res. – volume: 36 start-page: 411 year: 2006 end-page: 432 ident: br0190 article-title: Approximation algorithms for metric facility location problems publication-title: SIAM J. Comput. – volume: 38 start-page: 386 year: 2010 end-page: 389 ident: br0270 article-title: An approximation algorithm for the publication-title: Oper. Res. Lett. – year: 2004 ident: br0180 article-title: Facility location and the analysis of algorithms through factor-revealing programs – reference: M. Sviridenko, cited as personal communication in – year: 1988 ident: br0120 article-title: Geometric Algorithms and Combinatorial Optimization – start-page: 642 year: 2001 end-page: 651 ident: br0070 article-title: Algorithms for facility location problems with outliers publication-title: Proceedings of SODA – volume: 158 start-page: 453 year: 2010 end-page: 460 ident: br0110 article-title: A new approximation algorithm for the multilevel facility location problem publication-title: Discrete Appl. Math. – volume: 34 start-page: 803 year: 2005 end-page: 824 ident: br0060 article-title: Improved combinatorial algorithm for facility location problems publication-title: SIAM J. Comput. – volume: 53 start-page: 263 year: 2007 end-page: 297 ident: br0080 article-title: Approximation algorithms for soft-capacitated facility location in capacitated network design publication-title: Algorithmica – volume: 18 start-page: 207 year: 2004 end-page: 217 ident: br0020 article-title: Improved combinatorial approximation algorithms for the publication-title: SIAM J. Discrete Math. – volume: 32 start-page: 41 year: 2004 end-page: 43 ident: br0250 article-title: A note on maximizing a submodular set function subject to a knapsack constraint publication-title: Oper. Res. Lett. – volume: 48 start-page: 274 year: 2001 end-page: 296 ident: br0150 article-title: Approximation algorithms for metric facility location and publication-title: J. ACM – start-page: 265 year: 1997 end-page: 274 ident: br0210 article-title: Approximation algorithms for facility location problems publication-title: Proceedings of STOC – start-page: 240 year: 2002 end-page: 257 ident: br0240 article-title: An improved approximation algorithm for the metric uncapacitated facility location problem publication-title: Proceedings of IPCO – start-page: 623 year: 2005 end-page: 637 ident: br0280 article-title: An approximation algorithm for the dynamic facility location problem publication-title: Combinatorial Optimization in Communication Networks – volume: 33 start-page: 1 year: 2003 end-page: 25 ident: br0090 article-title: Improved approximation algorithms for the uncapacitated facility location problem publication-title: SIAM J. Comput. – volume: 32 start-page: 41 year: 2004 ident: 10.1016/j.tcs.2014.09.045_br0250 article-title: A note on maximizing a submodular set function subject to a knapsack constraint publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(03)00062-2 – volume: 50 start-page: 795 year: 2003 ident: 10.1016/j.tcs.2014.09.045_br0140 article-title: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP publication-title: J. ACM doi: 10.1145/950620.950621 – start-page: 642 year: 2001 ident: 10.1016/j.tcs.2014.09.045_br0070 article-title: Algorithms for facility location problems with outliers – start-page: 240 year: 2002 ident: 10.1016/j.tcs.2014.09.045_br0240 article-title: An improved approximation algorithm for the metric uncapacitated facility location problem – start-page: 623 year: 2005 ident: 10.1016/j.tcs.2014.09.045_br0280 article-title: An approximation algorithm for the dynamic facility location problem – volume: 158 start-page: 453 year: 2010 ident: 10.1016/j.tcs.2014.09.045_br0110 article-title: A new approximation algorithm for the multilevel facility location problem publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2009.11.007 – start-page: 265 year: 1997 ident: 10.1016/j.tcs.2014.09.045_br0210 article-title: Approximation algorithms for facility location problems – volume: 53 start-page: 48 year: 2005 ident: 10.1016/j.tcs.2014.09.045_br0220 article-title: Stochastic transportation-inventory network design problem publication-title: Oper. Res. doi: 10.1287/opre.1040.0140 – volume: 384 start-page: 126 year: 2007 ident: 10.1016/j.tcs.2014.09.045_br0320 article-title: A new approximation algorithm for the k-facility location problem publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2007.05.024 – volume: 39 start-page: 2212 year: 2010 ident: 10.1016/j.tcs.2014.09.045_br0040 article-title: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem publication-title: SIAM J. Comput. doi: 10.1137/070708901 – volume: 33 start-page: 1 year: 2003 ident: 10.1016/j.tcs.2014.09.045_br0090 article-title: Improved approximation algorithms for the uncapacitated facility location problem publication-title: SIAM J. Comput. doi: 10.1137/S0097539703405754 – volume: 72 start-page: 161 year: 1999 ident: 10.1016/j.tcs.2014.09.045_br0010 article-title: A 3-approximation algorithm for the k-level uncapacitated facility location problem publication-title: Inform. Process. Lett. doi: 10.1016/S0020-0190(99)00144-1 – volume: 36 start-page: 411 year: 2006 ident: 10.1016/j.tcs.2014.09.045_br0190 article-title: Approximation algorithms for metric facility location problems publication-title: SIAM J. Comput. doi: 10.1137/S0097539703435716 – year: 2001 ident: 10.1016/j.tcs.2014.09.045_br0100 – volume: 31 start-page: 228 year: 1999 ident: 10.1016/j.tcs.2014.09.045_br0130 article-title: Greedy strike back: improved facility location algorithms publication-title: J. Algorithms doi: 10.1006/jagm.1998.0993 – start-page: 157 year: 2012 ident: 10.1016/j.tcs.2014.09.045_br0050 article-title: Improved LP-rounding approximation algorithm for k-level uncapacitated facility location – year: 1988 ident: 10.1016/j.tcs.2014.09.045_br0120 – volume: 30 start-page: 389 year: 2005 ident: 10.1016/j.tcs.2014.09.045_br0300 article-title: A multiexchange local search algorithm for the capacitated facility location problem publication-title: Math. Oper. Res. doi: 10.1287/moor.1040.0125 – ident: 10.1016/j.tcs.2014.09.045_br0230 – volume: 48 start-page: 274 year: 2001 ident: 10.1016/j.tcs.2014.09.045_br0150 article-title: Approximation algorithms for metric facility location and k-median problems using the primal–dual schema and Lagrangian relaxation publication-title: J. ACM doi: 10.1145/375827.375845 – volume: 34 start-page: 803 year: 2005 ident: 10.1016/j.tcs.2014.09.045_br0060 article-title: Improved combinatorial algorithm for facility location problems publication-title: SIAM J. Comput. doi: 10.1137/S0097539701398594 – volume: 108 start-page: 97 year: 2006 ident: 10.1016/j.tcs.2014.09.045_br0200 article-title: Hedging uncertainty: approximation algorithms for stochastic optimization problems publication-title: Math. Program., Ser. A doi: 10.1007/s10107-005-0673-5 – start-page: 718 year: 2012 ident: 10.1016/j.tcs.2014.09.045_br0160 article-title: Inapproximability of the multilevel uncapacitated facility location problem – volume: 53 start-page: 263 year: 2007 ident: 10.1016/j.tcs.2014.09.045_br0080 article-title: Approximation algorithms for soft-capacitated facility location in capacitated network design publication-title: Algorithmica doi: 10.1007/s00453-007-9032-7 – volume: 30 start-page: 333 year: 2002 ident: 10.1016/j.tcs.2014.09.045_br0310 article-title: A note on the maximization version of the multi-level facility location problem publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(02)00183-9 – year: 2001 ident: 10.1016/j.tcs.2014.09.045_br0260 – volume: 18 start-page: 207 year: 2004 ident: 10.1016/j.tcs.2014.09.045_br0020 article-title: Improved combinatorial approximation algorithms for the k-level facility location problem publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480102417215 – volume: 38 start-page: 386 year: 2010 ident: 10.1016/j.tcs.2014.09.045_br0270 article-title: An approximation algorithm for the k-level stochastic facility location problem publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2010.04.010 – volume: 222 start-page: 45 year: 2013 ident: 10.1016/j.tcs.2014.09.045_br0170 article-title: A 1.488-approximation algorithm for the uncapacitated facility location problem publication-title: Inform. and Comput. doi: 10.1016/j.ic.2012.01.007 – start-page: 55 year: 2001 ident: 10.1016/j.tcs.2014.09.045_br0030 article-title: A simple dual ascent algorithm for the multilevel facility location problem – year: 2004 ident: 10.1016/j.tcs.2014.09.045_br0180 – volume: 108 start-page: 159 year: 2006 ident: 10.1016/j.tcs.2014.09.045_br0290 article-title: Approximating the two-level facility location problem via a quasi-greedy approach publication-title: Math. Program., Ser. A doi: 10.1007/s10107-006-0704-x |
| SSID | ssj0000576 |
| Score | 2.1010315 |
| Snippet | The main contribution of this work is to propose a primal–dual combinatorial 3(1+ε)-approximation algorithm for the two-level facility location problem... The main contribution of this work is to propose a primal-dual combinatorial -approximation algorithm for the two-level facility location problem (2-LFLP) by... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 213 |
| SubjectTerms | Algorithms Approximation Approximation algorithm Combinatorial analysis Computer simulation Facility location problem Mathematical analysis Multilevel Operations research Primal–dual algorithm Site selection |
| Title | Primal–dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach |
| URI | https://dx.doi.org/10.1016/j.tcs.2014.09.045 https://www.proquest.com/docview/1660043500 |
| Volume | 562 |
| WOSCitedRecordID | wos000347602000016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELag5QAHHoWK8pKREAdWQUmcbOJjBVsBKksPqbQ3y3aSNlXIbjdJ2Z_P-JWmRVTlwCVaWXYS7fdlHh7PDELvchEJmvi5F5UEHBQe5h4FreURKfKEgH6hgdDNJpL5PF0s6JE9q9rqdgJJ06SbDV39V6hhDMBWqbP_APdwUxiA3wA6XAF2uN4K-CNVP6L2dI6Vrhi-qUx64oTXJ8t11Z3-HM4Wdr-WXq2ODam-O5W2yJVy07Ntq5nJhUrbmujbnfe8rTzw0EE0D9XIx-ZtNkqLlLZfxMQq2UH89ybMD2Onl3lon3tjzjcndVG5wYUZhIf0lsR2f8LkZrqMLBV1oaYzipO2sRW-Tl6SkeoNTfL8H1LdbDCcfeykKrAemMq0pgrl1Qra8x_s4PjwkGWzRfZ-de6p5mIqCG87rdxF26raPQi_7f2vs8W3S5UdJyaobV_Yhb_1QcBrT_2bAXNNlWv7JHuMHlrHAu8bQjxBd4pmBz1yTTuwleE76MH3oVBv-xStRmzBV9iCB7ZgYAuGNXhgC3ZswY4t2LIFA1swx_p2Y7Zgx5Zn6Phgln364tkmHJ4kxO-82A9ESDiNC879PBbTgick5ZQUQSinXAoJLkUJTrPgZSxKCuqS0iKN4NuPwDrNyS7aapZN8RzhMAH3Oi2TQuRpVMYxB_cXluYS3H6Q_nIP-e6fZdJWqFeNUmrmjiKeMQCDKTCYTxmAsYc-DEtWpjzLTZMjBxez1Dd2IwOi3bTsrYOWgexVATXeFMu-ZcF0qiLpse-_uMWcl-i--j7M_t0rtNWt--I1uicvuqpdv7GU_A3Ek6xO |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Primal-dual+approximation+algorithm+for+the+two-level+facility+location+problem+via+a+dual+quasi-greedy+approach&rft.jtitle=Theoretical+computer+science&rft.au=Wu%2C+Chenchen&rft.au=Du%2C+Donglei&rft.au=Xu%2C+Dachuan&rft.date=2015&rft.issn=0304-3975&rft.volume=562&rft.spage=213&rft.epage=226&rft_id=info:doi/10.1016%2Fj.tcs.2014.09.045&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |