{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T02:33:35Z","timestamp":1768790015331,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,7,9]],"date-time":"2011-07-09T00:00:00Z","timestamp":1310169600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10732-011-9179-x","type":"journal-article","created":{"date-parts":[[2011,7,8]],"date-time":"2011-07-08T17:41:13Z","timestamp":1310146873000},"page":"297-315","source":"Crossref","is-referenced-by-count":4,"title":["A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand"],"prefix":"10.1007","volume":"18","author":[{"given":"Chase","family":"Rainwater","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Geunes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. Edwin","family":"Romeijn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,9]]},"reference":[{"issue":"3","key":"9179_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0305-0483(03)00025-2","volume":"31","author":"V. Adlakha","year":"2003","unstructured":"Adlakha, V., Kowalski, K.: A simple heuristic for solving small fixed-charge transportation problems. Omega 31(3), 205\u2013211 (2003)","journal-title":"Omega"},{"key":"9179_CR2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"R.K. Ahuja","year":"2001","unstructured":"Ahuja, R.K., Orlin, J.B., Sharma, D.: Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem. Math. Program. 91, 71\u201397 (2001)","journal-title":"Math. Program."},{"key":"9179_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Olrin, J.B., Punnen, A.: A survey of very large scale neighborhood search techniques. Discrete Appl. Math. 123, 75\u2013102 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"9179_CR4","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1287\/mnsc.1030.0193","volume":"50","author":"R.K. Ahuja","year":"2004","unstructured":"Ahuja, R.K., Orlin, J.B., Pallottino, S., Scaparra, M.P., Scutella, M.G.: A multi-exchange heuristic for the single-source capacitated facility location problem. Manag. Sci. 50(6), 749\u2013760 (2004)","journal-title":"Manag. Sci."},{"key":"9179_CR5","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1287\/ijoc.1050.0151","volume":"19","author":"R.K. Ahuja","year":"2007","unstructured":"Ahuja, R.K., Huang, W., Romeijn, H.E., Morales, D.R.: A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints. INFORMS J. Comput. 19, 14\u201326 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"9179_CR6","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.51.1.94.12791","volume":"51","author":"A. Balakrishnan","year":"2003","unstructured":"Balakrishnan, A., Geunes, J.: Production planning with flexible product specifications: an application to specialty steel manufacturing. Oper. Res. 51(1), 94\u2013112 (2003)","journal-title":"Oper. Res."},{"issue":"2","key":"9179_CR7","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","volume":"15","author":"J. Barcelo","year":"1984","unstructured":"Barcelo, J., Casanovas, J.: A heuristic Lagrangian algorithm for the capacitated plant location problem. Eur. J. Oper. Res. 15(2), 212\u2013226 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"9179_CR8","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","volume":"65","author":"J.E. Beasley","year":"1993","unstructured":"Beasley, J.E.: Lagrangian heuristics for location problems. Eur. J. Oper. Res. 65, 383\u2013399 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"9179_CR9","unstructured":"Delmaire, H., Diaz, J.A., Fernandez, E., Ortega, M.: Comparing new heuristics for the capacitated plant location problem. Technical Report DR97\/10, Department of Statistics and Operations Research, Universitat Politecnica de Catalunya, Barcelona, Spain (1997)"},{"issue":"3","key":"9179_CR10","first-page":"194","volume":"37","author":"H. Demaire","year":"1999","unstructured":"Demaire, H., Diaz, J.A., Fernandez, E., Ortega, M.: Reactive grasp and tabu search based heuristics for the single source capacitated plant location problem. Inf. Syst. Oper. Res. 37(3), 194\u2013225 (1999)","journal-title":"Inf. Syst. Oper. Res."},{"issue":"6","key":"9179_CR11","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D. Erlenkotter","year":"1978","unstructured":"Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Oper. Res. 26(6), 992\u20131009 (1978)","journal-title":"Oper. Res."},{"issue":"1","key":"9179_CR12","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/mnsc.3.1.24","volume":"3","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Solving the transportation problem. Manag. Sci. 3(1), 24\u201332 (1956)","journal-title":"Manag. Sci."},{"issue":"6","key":"9179_CR13","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1287\/opre.51.6.922.24914","volume":"51","author":"R. Freling","year":"2003","unstructured":"Freling, R., Romeijn, H.E., Romero Morales, D., Wagelmans, A.P.M.: A branch-and-price algorithm for the multi-period single-sourcing problem. Oper. Res. 51(6), 922\u2013939 (2003)","journal-title":"Oper. Res."},{"key":"9179_CR14","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R. Fukasawa","year":"2006","unstructured":"Fukasawa, R., Longo, H., Lysgaard, J., de Aragao, M.P., Reis, M., Uchoa, E., Werneck, R.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106, 491\u2013511 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"9179_CR15","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/S0377-2217(02)00504-0","volume":"150","author":"D. Ghosh","year":"2003","unstructured":"Ghosh, D.: Neighborhood search heuristics for the uncapacitated facility location problem. Eur. J. Oper. Res. 150(1), 150\u2013162 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9179_CR16","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1287\/opre.19.6.1529","volume":"19","author":"P. Gray","year":"1971","unstructured":"Gray, P.: Exact solution of the fixed-charge transportation problem. Oper. Res. 19(6), 1529\u20131538 (1971)","journal-title":"Oper. Res."},{"issue":"3","key":"9179_CR17","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1057\/palgrave.jors.2600698","volume":"50","author":"K.S. Hindi","year":"1999","unstructured":"Hindi, K.S., Pienkosz, K.: Efficient solution of large scale, single-source, capacitated plant location problems. J. Oper. Res. Soc. 50(3), 268\u2013274 (1999)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"9179_CR18","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1986.84","volume":"37","author":"J.G. Klincewicz","year":"1986","unstructured":"Klincewicz, J.G., Luss, H.: A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints. J. Oper. Res. Soc. 37(5), 495\u2013500 (1986)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"9179_CR19","first-page":"678","volume":"47","author":"J.K. Lee","year":"1996","unstructured":"Lee, J.K., Kim, Y.D.: Search heuristics for resource constrained project scheduling. J. Risk 47(5), 678\u2013689 (1996)","journal-title":"J. Risk"},{"issue":"2","key":"9179_CR20","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, V.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"9179_CR21","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.endm.2005.05.052","volume":"19","author":"A. Pigatti","year":"2005","unstructured":"Pigatti, A., Poggi\u00a0de\u00a0Aragao, M., Uchoa, E.: Stabilized branch-and-cut-and-price for the generalized assignment problem. Electr. Notes Discrete Math. 19, 389\u2013395 (2005)","journal-title":"Electr. Notes Discrete Math."},{"key":"9179_CR22","unstructured":"Rainwater, C., Geunes, J., Romeijn, H.E.: Capacitated facility location problem with single-source constraints and flexible demand. Technical report, Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, June (2008)"},{"key":"9179_CR23","author":"C. Rainwater","year":"2008","unstructured":"Rainwater, C., Geunes, J., Romeijn, H.E.: The generalized assignment problem with flexible jobs. Discrete Appl. Math. (2008). doi: 10.1016\/j.dam.2008.04.017","journal-title":"Discrete Appl. Math."},{"key":"9179_CR24","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"T.K. Ralphs","year":"2003","unstructured":"Ralphs, T.K., Kopman, L., Pulleybank, W.R., Trotter, L.E.: On the capacitated vehicle routing problem. Math. Program. 94, 343\u2013359 (2003)","journal-title":"Math. Program."},{"key":"9179_CR25","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"issue":"6","key":"9179_CR26","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M.P.W. Savelsbergh","year":"1997","unstructured":"Savelsbergh, M.P.W.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6), 831\u2013841 (1997)","journal-title":"Oper. Res."},{"key":"9179_CR27","doi-asserted-by":"crossref","first-page":"2563","DOI":"10.1016\/j.cor.2005.07.014","volume":"33","author":"M. Sun","year":"2006","unstructured":"Sun, M.: Solving the uncapacitated facility location problem using tabu search. Comput. Oper. Res. 33, 2563\u20132589 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9179_CR28","unstructured":"Thompson, P., Orlin, J.B.: The theory of cyclic transfers. Technical Report 200-89, Operations Research Center, Massachusetts Institute of Technology, Cambridge MA (1989)"},{"key":"9179_CR29","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"P.M. Thompson","year":"1993","unstructured":"Thompson, P.M., Psaraftis, H.N.: Cycle transfer algorithms for multi-vehicle routing and scheduling problems. Oper. Res. 41, 935\u2013946 (1993)","journal-title":"Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9179-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9179-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9179-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:32Z","timestamp":1559242472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9179-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,9]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9179"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9179-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,9]]}}}