{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T22:30:09Z","timestamp":1769812209687,"version":"3.49.0"},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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":[[2003,12]]},"DOI":"10.1016\/s0377-2217(02)00829-9","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T10:38:35Z","timestamp":1046774315000},"page":"333-351","source":"Crossref","is-referenced-by-count":64,"title":["Upper and lower bounds for the single source capacitated location problem"],"prefix":"10.1016","volume":"151","author":[{"given":"Maria Jo\u00e3o","family":"Cortinhal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Eug\u00e9nia","family":"Captivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00829-9_BIB1","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1057\/palgrave.jors.2600621","article-title":"Lagrangean heuristics applied to a variety of large scale capacitated plant location problems","volume":"49","author":"Agar","year":"1998","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB2","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","article-title":"A heuristic Lagrangean algorithm for the capacitated plant location problem","volume":"15","author":"Barcel\u00f3","year":"1984","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB3","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0377-2217(91)90091-9","article-title":"Computational results from a new relaxation algorithm for the capacitated plant location problem","volume":"53","author":"Barcel\u00f3","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-Library: Distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"Journal of the Operational Society"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB5","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","article-title":"Lagrangean heuristics for location problems","volume":"65","author":"Beasley","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB6","series-title":"Combinatorial Optimization","author":"Christofides","year":"1979"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB7","unstructured":"CPLEX Optimization, Inc., Using the CPLEX Callable Library, version 3.0, 1974"},{"issue":"11","key":"10.1016\/S0377-2217(02)00829-9_BIB8","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1057\/jors.1988.173","article-title":"Lagrangean relaxation and the single source capacitated facility location problem","volume":"39","author":"Darby-Dowman","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB9","unstructured":"H. Delmaire, J.A. Diaz, E. Fernandez, M. Ortega, Comparing new heuristics for the pure integer capacitated plant location problem, research report DR97\/10, Dpt E10, Universidad Politecnica de Catalunya, Spain"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB10","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1287\/opre.19.6.1406","article-title":"An all zero-one algorithm for a certain class of transportation problems","volume":"19","author":"DeMaio","year":"1971","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB11","unstructured":"Q. Deng, D. Simchi-Levi, Valid inequalities, facets and computational results for the capacitated concentrator location problem, Unpublished paper, 1992"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB12","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","article-title":"A dual-based procedure for the uncapacitated facility location","volume":"26","author":"Erlenkotter","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0966-8349(98)00046-1","article-title":"A tabu search heuristic for the concentrator location problem","volume":"6","author":"Fiho","year":"1998","journal-title":"Location Science"},{"issue":"6","key":"10.1016\/S0377-2217(02)00829-9_BIB14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"Floyd","year":"1962","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB15","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future path for integer programming and links to artificial intelligence","volume":"1","author":"Glover","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB16","series-title":"Tabu Search","author":"Glover","year":"1997"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB17","unstructured":"M. Guignard-Spielberg, S. Kim, A strong Lagrangean relaxation for the capacitated plant location problems, Working paper no. 56, Department of statistics, The Wharton School, University of Pennsylvania, 1983"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB18","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The travelling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB19","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The travelling salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1970","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB20","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1057\/palgrave.jors.2600698","article-title":"Efficient solution of large scale, single source, capacitated plant location problem","volume":"50","author":"Hindi","year":"1999","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB21","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","article-title":"An exact algorithm for the capacitated facility location problems with single sourcing","volume":"113","author":"Holmberg","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB22","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1986.84","article-title":"A Lagrangean relaxation heuristic for the capacitated facility location with single-source constraints","volume":"37\/5","author":"Klincewicz","year":"1986","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB23","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","article-title":"A heuristic program for locating warehouses","volume":"9","author":"Kuehn","year":"1963","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB24","unstructured":"S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, John Wiley & Sons, New York, ISBN 0-471-92420-2, 1990"},{"issue":"11","key":"10.1016\/S0377-2217(02)00829-9_BIB25","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1057\/jors.1983.242","article-title":"An algorithm for the fixed-charge assigning users to sources problem","volume":"34","author":"Neebe","year":"1983","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB26","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1057\/jors.1978.263","article-title":"An improved algorithm for the capacitated facility location problem","volume":"29","author":"Nauss","year":"1978","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB27","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","article-title":"Efficient algorithms for the capacitated concentrator problem","volume":"14","author":"Pirkul","year":"1987","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00829-9_BIB28","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0377-2217(93)90219-D","article-title":"A Lagrangean heuristic for the capacitated plant problem with single source constraints","volume":"66","author":"Sridharan","year":"1993","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008299?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008299?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T02:26:13Z","timestamp":1553653573000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702008299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0377221702008299"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00829-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}