{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:45Z","timestamp":1725559005209},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_36","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T06:29:15Z","timestamp":1279088955000},"page":"330-339","source":"Crossref","is-referenced-by-count":1,"title":["An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands"],"prefix":"10.1007","author":[{"given":"Adriana F.","family":"Bumb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan-Kees C. W.","family":"van Ommeren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","first-page":"119","volume-title":"Discrete Location Theory","author":"G. Cornuejols","year":"1990","unstructured":"Cornuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P., Francis, R. (eds.) Discrete Location Theory, pp. 119\u2013171. John Wiley and Sons, New York (1990)"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Shmoys, D., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"issue":"2","key":"36_CR3","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0196-6774(03)00056-7","volume":"48","author":"S. Guha","year":"2003","unstructured":"Guha, S., Meyerson, A., Munagala, K.: A constant factor approximation algorithm for the fault-tolerant facility location problem. J. Algorithms\u00a048(2), 429\u2013440 (2003)","journal-title":"J. Algorithms"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-45753-4_20","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M. Mahdian","year":"2002","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: A 1.52 approximation algorithm for the uncapacitated facility location problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 229\u2013242. Springer, Heidelberg (2002)"},{"issue":"1","key":"36_CR5","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. Journal of Algorithms\u00a031(1), 228\u2013248 (1999)","journal-title":"Journal of Algorithms"},{"key":"36_CR6","unstructured":"Sviridenko, M.: Personal communication. Cited in S. Guha, Approximation algorithms for facility location problems, PhD thesis, Stanford (2000) (Downloadable from website), http:\/\/Theory.Stanford.EDU\/~sudipto"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem. In: RANDOM-APPROX, pp. 129-140 (2003)","DOI":"10.1007\/978-3-540-45198-3_12"},{"issue":"1","key":"36_CR8","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1002\/net.10080","volume":"42","author":"M.G. Hajiaghayi","year":"2003","unstructured":"Hajiaghayi, M.G., Mahdian, M., Mirrokni, V.S.: The facility location problem with general cost functions. Networks\u00a042(1), 42\u201347 (2003)","journal-title":"Networks"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-25960-2_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"J. Zhang","year":"2004","unstructured":"Zhang, J., Chen, B., Ye, Y.: A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 219\u2013233. Springer, Heidelberg (2004)"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/0377-2217(89)90192-6","volume":"39","author":"R. Batta","year":"1989","unstructured":"Batta, R.: A queuing location model with expected service time dependent queuing disciplines. European Journal of Operational Research\u00a039, 192\u2013205 (1989)","journal-title":"European Journal of Operational Research"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1287\/opre.33.4.746","volume":"12","author":"O. Berman","year":"1985","unstructured":"Berman, O., Larson, R., Chiu, S.: Optimal server location on a network operating as a M\/G\/1 queue. Operations Research\u00a012, 746\u2013771 (1985)","journal-title":"Operations Research"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0305-0548(99)00128-8","volume":"28","author":"O. Berman","year":"2001","unstructured":"Berman, O., Sapna, K.: Optimal control of service for facilities holding inventory. Computers & Operations Research\u00a028, 429\u2013441 (2001)","journal-title":"Computers & Operations Research"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1020989316737","volume":"111","author":"V. Marianov","year":"2002","unstructured":"Marianov, V., Serra, D.: Location-allocation of multiple-server service centers with constrained queues or waiting times. Annals of Operations Research\u00a0111, 35\u201350 (2002)","journal-title":"Annals of Operations Research"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1020961732667","volume":"111","author":"Q. Wang","year":"2002","unstructured":"Wang, Q., Batta, R., Rump, C.: Algorithms for a facility location problem with stochastic customer demand and immobile servers. Annals of Operations Research\u00a0111, 17\u201334 (2002)","journal-title":"Annals of Operations Research"},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-25960-2_8","volume-title":"Integer Programming and Combinatorial Optimization","author":"R. Ravi","year":"2004","unstructured":"Ravi, R., Sinha, A.: Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 101\u2013115. Springer, Heidelberg (2004)"},{"key":"36_CR16","unstructured":"Mahdian, M.: Facility Location and the Analysis of Algorithms through Factor-Revealing Programs, Ph.D. Thesis, MIT (June 2004), available at http:\/\/www-math.mit.edu\/~mahdian\/phdthesis.pdf"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1098\/rspa.1955.0198","volume":"232","author":"W.L. Smith","year":"1955","unstructured":"Smith, W.L.: Regenerative stochastic processes. Proc. Roy Soc. Ser. A\u00a0232, 6\u201331 (1955)","journal-title":"Proc. Roy Soc. Ser. A"},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-39658-1_38","volume-title":"Algorithms - ESA 2003","author":"M. Mahdian","year":"2003","unstructured":"Mahdian, M., Pal, M.: Universal Facility Location. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 409\u2013421. Springer, Heidelberg (2003)"},{"key":"36_CR19","volume-title":"Fundamentals of Queueing Theory","author":"D. Gross","year":"1998","unstructured":"Gross, D., Harris, C.M.: Fundamentals of Queueing Theory, 3rd edn. John Wiley & Sons, Inc., Chichester (1998)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:54:24Z","timestamp":1559253264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11496199_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}