{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T06:03:49Z","timestamp":1749621829381,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_33","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"452-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Inventory Routing Problem with Facility Location"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9583-0784","authenticated-orcid":false,"given":"Yang","family":"Jiao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7603-1207","authenticated-orcid":false,"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-6377(89)90001-1","volume":"8","author":"E Arkin","year":"1989","unstructured":"Arkin, E., Joneja, D., Roundy, R.: Computational complexity of uncapacitated multi-echelon production planning problems. Oper. Res. Lett. 8, 61\u201366 (1989)","journal-title":"Oper. Res. Lett."},{"doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Byrka, J., Chrobak, M., Je\u017c, L., Nogneng, D., Sgall, J.: Better approximation bounds for the joint replenishment problem. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 42\u201354 (2014)","key":"33_CR2","DOI":"10.1137\/1.9781611973402.4"},{"issue":"1\u20132","key":"33_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-015-0920-3","volume":"158","author":"M Cheung","year":"2016","unstructured":"Cheung, M., Elmachtoub, A., Levi, R., Shmoys, D.: The submodular joint replenishment problem. Math. Program. 158(1\u20132), 207\u2013233 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"33_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703405754","volume":"33","author":"FA Chudak","year":"2004","unstructured":"Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33(1), 1\u201325 (2004)","journal-title":"SIAM J. Comput."},{"unstructured":"Fukunaga, T., Nikzad, A., Ravi, R.: Deliver or hold: approxmation algorithms for the periodic inventory routing problem. In: Proceedings of the 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 209\u2013225 (2014)","key":"33_CR5"},{"issue":"17","key":"33_CR6","doi-asserted-by":"publisher","first-page":"3238","DOI":"10.1016\/j.dam.2008.05.013","volume":"156","author":"H Glicksman","year":"2008","unstructured":"Glicksman, H., Penn, M.: Approximation algorithms for group prize-collecting and location-routing problems. Discrete Appl. Math. 156(17), 3238\u20133247 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/trsc.1120.0423","volume":"47","author":"T Harks","year":"2013","unstructured":"Harks, T., K\u00f6nig, F., Matuschke, J.: Approximation algorithms for capacitated location routing. Transp. Sci. 47(1), 3\u201321 (2013)","journal-title":"Transp. Sci."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50, 795\u2013824 (2003)","journal-title":"J. ACM"},{"issue":"2","key":"33_CR10","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J. ACM 48(2), 274\u2013296 (2001)","journal-title":"J. ACM"},{"unstructured":"Jiao, Y., Ravi, R.: Inventory routing problem with facility location. CoRR abs\/1905.00148 (2019). https:\/\/arxiv.org\/abs\/1905.00148","key":"33_CR11"},{"issue":"2","key":"33_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/moor.1050.0178","volume":"31","author":"R Levi","year":"2006","unstructured":"Levi, R., Roundy, R., Shmoys, D.: Primal-dual algorithms for deterministic inventory problems. Math. Oper. Res. 31(2), 267\u2013284 (2006)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"33_CR13","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1287\/mnsc.1070.0781","volume":"54","author":"R Levi","year":"2008","unstructured":"Levi, R., Roundy, R., Shmoys, D., Sviridenko, M.: First constant approximation algorithm for the one-warehouse multi-retailer problem. Manage. Sci. 54(4), 763\u2013776 (2008)","journal-title":"Manage. Sci."},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.ic.2012.01.007","volume":"222","author":"S Li","year":"2013","unstructured":"Li, S.: A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf. Comput. 222, 45\u201358 (2013)","journal-title":"Inf. Comput."},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0020-0190(92)90208-D","volume":"44","author":"J Lin","year":"1992","unstructured":"Lin, J., Vitter, J.S.: Approximation algorithms for geometric median problems. Inf. Process. Lett. 44, 245\u2013249 (1992)","journal-title":"Inf. Process. Lett."},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-0981-y","volume":"160","author":"V Nagarajan","year":"2016","unstructured":"Nagarajan, V., Shi, C.: Approximation algorithms for inventory problems with submodular or routing costs. Math. Program. 160, 1\u201320 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"33_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1142\/S1793830909000130","volume":"1","author":"T Nonner","year":"2009","unstructured":"Nonner, T., Souza, A.: Approximating the joint replenishment problem with deadlines. Discrete Math. Alg. Appl. 1(2), 153\u2013174 (2009)","journal-title":"Discrete Math. Alg. Appl."},{"issue":"1","key":"33_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/opre.1050.0228","volume":"54","author":"R Ravi","year":"2006","unstructured":"Ravi, R., Sinha, A.: Approximation algorithms for problems combining facility location and network design. Oper. Res. 54(1), 73\u201381 (2006)","journal-title":"Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 265\u2013274. ACM (1997)","key":"33_CR19","DOI":"10.1145\/258533.258600"},{"key":"33_CR20","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"HM Wagner","year":"1958","unstructured":"Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot sizing model. Manage. Sci. 5, 89\u201396 (1958)","journal-title":"Manage. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:55:16Z","timestamp":1710266116000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}