{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T07:08:51Z","timestamp":1775632131867,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,2,8]],"date-time":"2012-02-08T00:00:00Z","timestamp":1328659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10479-012-1068-7","type":"journal-article","created":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T10:03:29Z","timestamp":1328609009000},"page":"407-426","source":"Crossref","is-referenced-by-count":74,"title":["The stop-and-drop problem in nonprofit food distribution networks"],"prefix":"10.1007","volume":"221","author":[{"given":"Senay","family":"Solak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christina","family":"Scherrer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Ghoniem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,8]]},"reference":[{"key":"1068_CR1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF02568604","volume":"4","author":"J. E. Beasley","year":"1996","unstructured":"Beasley, J. E., & Nascimento, E. M. (1996). The vehicle routing-allocation problem: A unifying framework. Top, 4, 65\u201386.","journal-title":"Top"},{"key":"1068_CR2","doi-asserted-by":"crossref","first-page":"2226","DOI":"10.1016\/S0140-6736(03)13779-8","volume":"361","author":"R. Black","year":"2003","unstructured":"Black, R., Morris, S., & Bryce, J. (2003). Where and why are 10 million children dying every year? The Lancet, 361, 2226\u20132234.","journal-title":"The Lancet"},{"key":"1068_CR3","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., & Wright, J. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12, 568\u2013581.","journal-title":"Operations Research"},{"issue":"4","key":"1068_CR4","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1287\/opre.1060.0286","volume":"54","author":"G. Codato","year":"2006","unstructured":"Codato, G., & Fischetti, M. (2006). Combinatorial Benders cuts for mixed-integer linear programming. Operations Research, 54(4), 756\u2013766.","journal-title":"Operations Research"},{"key":"1068_CR5","first-page":"247","volume-title":"Proceedings of the 23rd international conference on industrial engineering and other applications of applied intelligent systems: part II","author":"L. V. Souza de","year":"2010","unstructured":"de Souza, L. V., & Siqueira, P. H. (2010). Heuristic methods applied to the optimization school bus transportation routes: a real case. In Proceedings of the 23rd international conference on industrial engineering and other applications of applied intelligent systems: part II (pp.\u00a0247\u2013256). Berlin: Springer."},{"key":"1068_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M. Desrochers","year":"1991","unstructured":"Desrochers, M., & Laporte, G. (1991). Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters, 10, 27\u201336.","journal-title":"Operations Research Letters"},{"key":"1068_CR7","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/978-3-642-04244-7_28","volume-title":"Principles and practice of constraint programming\u2014CP 2009","author":"M. M. Fazel-Farandi","year":"2009","unstructured":"Fazel-Farandi, M. M., & Beck, J. C. (2009). Solving a location-allocation problem with logic-based Benders decomposition. In Principles and practice of constraint programming\u2014CP 2009 (pp. 344\u2013351). Berlin: Springer."},{"key":"1068_CR8","unstructured":"Feeding America (2009). Local Impact Study, September 2009. http:\/\/feedingamerica.org\/newsroom\/local-impact-study.aspx . Accessed 22 February 2010."},{"key":"1068_CR9","unstructured":"Food and Agriculture Organization of the United Nations (2009). Food security statistics. http:\/\/www.fao.org\/economic\/ess\/food-security-statistics\/en\/ . Accessed 22 February 2010."},{"issue":"2","key":"1068_CR10","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"B. Gillett","year":"1974","unstructured":"Gillett, B., & Miller, L. (1974). A heuristic algorithm for the vehicle-dispatch problem. Operations Research, 22(2), 340\u2013349.","journal-title":"Operations Research"},{"key":"1068_CR11","first-page":"287","volume-title":"Proceedings of the seventh international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR)","author":"C. Gunes","year":"2010","unstructured":"Gunes, C., van Hoeve, W.-J., & Tayur, S. (2010). Vehicle routing for food rescue programs: A comparison of different approaches. In Proceedings of the seventh international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR) (pp.\u00a0287\u2013291). Berlin: Springer."},{"key":"1068_CR12","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033036","volume-title":"Logic-based methods for optimization: combining optimization and constraint satisfaction","author":"J. N. Hooker","year":"2000","unstructured":"Hooker, J. N. (2000). Logic-based methods for optimization: combining optimization and constraint satisfaction. New York: Wiley."},{"issue":"3","key":"1068_CR13","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"J. N. Hooker","year":"2007","unstructured":"Hooker, J. N. (2007). Planning and scheduling by logic-based Benders decomposition. Operations Research, 55(3), 588\u2013602.","journal-title":"Operations Research"},{"key":"1068_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J. N. Hooker","year":"2003","unstructured":"Hooker, J. N., & Ottosson, G. (2003). Logic-based Benders decomposition. Mathematical Programming, 96, 33\u201360.","journal-title":"Mathematical Programming"},{"key":"1068_CR15","first-page":"267","volume-title":"Principles and practice of constraint programming: The newport papers","author":"J. N. Hooker","year":"1995","unstructured":"Hooker, J. N., & Yan, H. (1995). Logic circuit verification by Benders decomposition. In V. Saraswat & P.\u00a0Van Hentenryck (Eds.), Principles and practice of constraint programming: The newport papers (pp.\u00a0267\u2013288). Cambridge: MIT Press."},{"key":"1068_CR16","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"Jain, V., & Grossmann, I. E. (2001). Algorithms for hybrid MILP\/CLP models for a class of optimization problems. INFORMS Journal on Computing, 13, 258\u2013276.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"1068_CR17","first-page":"22","volume":"35","author":"M. P. Johnson","year":"2008","unstructured":"Johnson, M. P., & Smilowitz, K. (2008). Community-based operations research. OR\/MS Today, 35(1), 22\u201325.","journal-title":"OR\/MS Today"},{"key":"1068_CR18","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/S0377-2217(03)00377-1","volume":"158","author":"I. Kara","year":"2004","unstructured":"Kara, I., Laporte, G., & Bektas, T. (2004). A note on the lifted Miller\u2013Tucker\u2013Zemlin subtour elimination constraints for the capacitated vehicle routing problem. European Journal of Operational Research, 158, 793\u2013795.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1068_CR19","first-page":"24","volume":"26","author":"M. Labb\u00e9","year":"1986","unstructured":"Labb\u00e9, M., & Laporte, G. (1986). Maximizing user convenience and postal service efficiency in post box location. Belgian Journal of Operations Research, Statistics, and Computer Science, 26(2), 24\u201333.","journal-title":"Belgian Journal of Operations Research, Statistics, and Computer Science"},{"key":"1068_CR20","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.ejor.2003.07.010","volume":"160","author":"M. Labb\u00e9","year":"2005","unstructured":"Labb\u00e9, M., Laporte, G., Martin, I. R., & Gonzalez, J. J. S. (2005). Locating median cycles in networks. European Journal of Operational Research, 160, 457\u2013470.","journal-title":"European Journal of Operational Research"},{"key":"1068_CR21","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G. Laporte","year":"1993","unstructured":"Laporte, G., & Louveaux, F. (1993). The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters, 13, 133\u2013142.","journal-title":"Operations Research Letters"},{"key":"1068_CR22","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s00291-003-0145-3","volume":"26","author":"H. M. Blanc le","year":"2004","unstructured":"le Blanc, H. M., Fleuren, H. A., & Krikke, H. R. (2004). Redesign of a recycling system for LPG-tanks. OR-Spektrum, 26, 283\u2013304.","journal-title":"OR-Spektrum"},{"key":"1068_CR23","unstructured":"Lien, R., Iravani, S., & Smilowitz, K. (2010). Sequential resource allocation for nonprofit operations (Working paper). Available online at http:\/\/www.iems.northwestern.edu\/docs\/working_papers\/WP_10-02.pdf ."},{"key":"1068_CR24","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C. E. Miller","year":"1960","unstructured":"Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulations and traveling salesman problems. Journal of the Association for Computing Machinery, 7, 326\u2013329.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"2","key":"1068_CR25","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/opre.47.2.175","volume":"47","author":"K. Murty","year":"1999","unstructured":"Murty, K., & Djang, P. (1999). The US army national guard\u2019s mobile training simulators location and routing problem. Operations Research, 47(2), 175\u2013182.","journal-title":"Operations Research"},{"issue":"2","key":"1068_CR26","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"G. Nagy","year":"2007","unstructured":"Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2), 649\u2013672.","journal-title":"European Journal of Operational Research"},{"key":"1068_CR27","unstructured":"Nord, M., Andrews, M., & Carlson, S. (2008). Household food security in the United States. USDA Economic Research Report No. ERR-83."},{"key":"1068_CR28","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"H. D. Sherali","year":"2001","unstructured":"Sherali, H. D., & Smith, J. C. (2001). Improving discrete model representations via symmetry considerations. Management Science, 47, 1396\u20131407.","journal-title":"Management Science"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1068-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1068-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1068-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:33Z","timestamp":1559153373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1068-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,8]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["1068"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1068-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,8]]}}}