{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T04:58:00Z","timestamp":1776920280617,"version":"3.51.2"},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1016\/s0377-2217(03)00247-9","type":"journal-article","created":{"date-parts":[[2003,10,9]],"date-time":"2003-10-09T03:38:24Z","timestamp":1065670704000},"page":"576-591","source":"Crossref","is-referenced-by-count":102,"title":["A simple tabu search for warehouse location"],"prefix":"10.1016","volume":"157","author":[{"given":"Laurent","family":"Michel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00247-9_BIB1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/A:1018956213524","article-title":"A tabu search approach to the uncapacitated facility location problem","volume":"86","author":"Al-Sultan","year":"1999","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB2","article-title":"Simulated annealing algorithm for simple plant location problems","volume":"12","author":"Alves","year":"1992","journal-title":"Revista Investigacao Operacional"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB3","doi-asserted-by":"crossref","unstructured":"V. Arya, N. Garg, R. Khandekar, V. Pandit, Local search heuristics for k-median and facility location problems, in: Proceedings of the 33rd ACM Symposium on the Theory of Computing (STOC 2001), 2001","DOI":"10.1145\/380752.380755"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB4","unstructured":"F. Barahona, F. Chudak, Solving large scale uncapacitated location problems, IBM Research Report RC 21515, IBM Research Division, T.J. Watson Research Center, Yorktown Heights, New York, 1999"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB5","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF02404002","article-title":"Obtaining test problems via Internet","volume":"8","author":"Beasley","year":"1996","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB6","doi-asserted-by":"crossref","unstructured":"F.A. Chudak, Improved approximation algorithms for uncapacitated facility location, in: Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization, 1998, pp. 180\u2013194","DOI":"10.1007\/3-540-69346-7_14"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB7","doi-asserted-by":"crossref","unstructured":"C. Codognet, D. Diaz, Yet another local search method for constraint solving, in: AAAI Fall Symposium on Using Uncertainty within Computation, Cape Cod, MA, 2001","DOI":"10.1007\/3-540-45322-9_5"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01585746","article-title":"A projection method for the uncapacitated facility location problem","volume":"46","author":"Conn","year":"1990","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB9","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB10","series-title":"Discrete Location Theory","first-page":"119","article-title":"The uncapacitated facility location problem","author":"Cornu\u00e9jols","year":"1990"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB11","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","article-title":"A dual-based procedure for uncapacitated facility location: General solution procedures and computational experience","volume":"26","author":"Erlenkotter","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB12","unstructured":"V. Filipovic, J. Kratica, D. Tosic, I. Ljubic, Fine grained tournament selection for the simple plant location problem, in: Proceedings of the 5th Online World Conference on Soft Computing in Industrial Applications WSC5, 2000, pp. 152\u2013158"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB13","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/0377-2217(94)90277-1","article-title":"Uncapacitated facility location: General solution procedures and computational experience","volume":"76","author":"Gao","year":"1994","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB14","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0377-2217(88)90029-X","article-title":"A Langrangean dual ascent algorithm for simple plant location problems","volume":"35","author":"Guignard","year":"1988","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB15","series-title":"Meta-heuristics, Advances and Trends in Local Search Paradigms for Optimization","first-page":"433","article-title":"An introduction to variable neighborhood search","author":"Hansen","year":"1998"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB16","unstructured":"K. Holmberg, Experiments with primal-dual decomposition and subgradient method for the uncapacitated facility location problem, Research Report LITH-MATH\/OPT-WT-1995-08, Department of Mathematics, Linkoping Institute of Technology, Sweden, 1995"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0377-2217(89)90189-6","article-title":"On the exact solution of large-scale simple plant location problems","volume":"39","author":"Koerkel","year":"1989","journal-title":"European Journal of Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(03)00247-9_BIB18","first-page":"271","article-title":"Improving performances of the genetic algorithm by caching","volume":"18","author":"Kratica","year":"1999","journal-title":"Computers and Artificial Intelligence"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB19","unstructured":"J. Kratica, V. Filipovic, V. Sesum, D. Tosic, Solving the uncapacitated warehouse location problem using a simple genetic algorithm, in: Proceedings of the XIV International Conference on Material Handling and Warehousing, 1996, pp. 3.33\u20133.37"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB20","unstructured":"J. Kratica, D. Tosic, V. Filipovic, Solving the uncapacitated warehouse location problem by sga with add-heuristic, in: XV ECPD International Conference on Material Handling and Warehousing, 1998"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1051\/ro:2001107","article-title":"Solving the simple plant location problems by genetic algorithm","volume":"35","author":"Kratica","year":"2001","journal-title":"RAIRO Operations Research"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB22","series-title":"Discrete Location Theory","author":"Mirchandani","year":"1990"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB23","unstructured":"G. Ramalingam, Bounded incremental computation, PhD thesis, University of Wisconsin-Madison, 1993"},{"key":"10.1016\/S0377-2217(03)00247-9_BIB24","doi-asserted-by":"crossref","unstructured":"D.B. Schmoys, E. Tardos, K. Aardal, Approximation algorithms for facility location problems, in: Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 265\u2013274","DOI":"10.1145\/258533.258600"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002479?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703002479?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T22:46:31Z","timestamp":1585176391000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703002479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S0377221703002479"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00247-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}