{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T06:41:48Z","timestamp":1781678508466,"version":"3.54.5"},"reference-count":41,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,1,1]]},"abstract":"<p>In the two-stage capacitated facility location problem, a single product is produced at some plants in order to satisfy customer demands. The product is transported from these plants to some depots and then to the customers. The capacities of the plants and depots are limited. The aim is to select cost minimizing locations from a set of potential plants and depots. This cost includes fixed cost associated with opening plants and depots, and variable cost associated with both transportation stages. In this work, two different mixed integer linear programming formulations are considered for the problem. Several Lagrangian relaxations are analyzed and compared, and a Lagrangian heuristic producing feasible solutions is presented. The results of a computational study are reported.<\/p>","DOI":"10.4018\/ijeoe.2012010104","type":"journal-article","created":{"date-parts":[[2012,1,13]],"date-time":"2012-01-13T10:26:12Z","timestamp":1326450372000},"page":"59-71","source":"Crossref","is-referenced-by-count":23,"title":["Lagrangian Bounds and a Heuristic for the Two-Stage Capacitated Facility Location Problem"],"prefix":"10.4018","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1850-4755","authenticated-orcid":true,"given":"Igor","family":"Litvinchev","sequence":"first","affiliation":[{"name":"Nuevo Leon State University, Mexico"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edith L.","family":"Ozuna","sequence":"additional","affiliation":[{"name":"Nuevo Leon State University, Mexico"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijeoe.2012010104-0","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581103"},{"key":"ijeoe.2012010104-1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9125-x"},{"key":"ijeoe.2012010104-2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2003.03.001"},{"key":"ijeoe.2012010104-3","first-page":"173","article-title":"A general model for the uncapacitated facility and depot location problem.","volume":"2","author":"A.Barros","year":"1994","journal-title":"Location Science"},{"key":"ijeoe.2012010104-4","author":"J. E.Beasley","year":"1993","journal-title":"Lagrangian relaxation, modern heuristic techniques for combinatorial problems"},{"key":"ijeoe.2012010104-5","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00211-8"},{"key":"ijeoe.2012010104-6","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2008.77"},{"key":"ijeoe.2012010104-7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018942415824"},{"key":"ijeoe.2012010104-8","first-page":"29","article-title":"Multi-exchange neighborhood search heuristics for the multi-source capacitated facility location problem.","volume":"8","author":"C.Chyu","year":"2008","journal-title":"IEMS"},{"key":"ijeoe.2012010104-9","author":"A. J.Conejo","year":"2006","journal-title":"Decomposition techniques in mathematical programming"},{"key":"ijeoe.2012010104-10","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90261-S"},{"key":"ijeoe.2012010104-11","author":"M.Daskin","year":"2003","journal-title":"Logistics systems: Design and optimization"},{"key":"ijeoe.2012010104-12","doi-asserted-by":"publisher","DOI":"10.1016\/S0966-8349(98)00046-1"},{"key":"ijeoe.2012010104-13","doi-asserted-by":"publisher","DOI":"10.1287\/inte.15.2.10"},{"key":"ijeoe.2012010104-14","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90277-1"},{"key":"ijeoe.2012010104-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.02.009"},{"key":"ijeoe.2012010104-16","author":"S.G\u00f6rtz","year":"2009","journal-title":"A subgradient-based branch and bound algorithm for the capacitated facility location problem"},{"key":"ijeoe.2012010104-17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579036"},{"key":"ijeoe.2012010104-18","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1057\/palgrave.jors.2600675","article-title":"An LP-based heuristic for two-stage capacitated facility location problems.","volume":"50","author":"A.Klose","year":"1999","journal-title":"The Journal of the Operational Research Society"},{"key":"ijeoe.2012010104-19","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00300-8"},{"key":"ijeoe.2012010104-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.10.031"},{"key":"ijeoe.2012010104-21","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1050.0410"},{"key":"ijeoe.2012010104-22","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-008-9165-x"},{"key":"ijeoe.2012010104-23","author":"L. S.Lasdon","year":"2002","journal-title":"Optimization theory for large systems"},{"key":"ijeoe.2012010104-24","first-page":"987","article-title":"Capacitated fuzzy two-stage location- allocation problem. International Journal of Innovative Computing","volume":"3","author":"Y.Liu","year":"2007","journal-title":"Information and Control"},{"key":"ijeoe.2012010104-25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.03.002"},{"key":"ijeoe.2012010104-26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.04.052"},{"key":"ijeoe.2012010104-27","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018998500803"},{"key":"ijeoe.2012010104-28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4975-8"},{"key":"ijeoe.2012010104-29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.05.007"},{"key":"ijeoe.2012010104-30","author":"I.Minis","year":"2011","journal-title":"Supply chain management: Advances and intelligent methods"},{"key":"ijeoe.2012010104-31","first-page":"583","article-title":"A preprocessing procedure for fixing the binary variables in the capacitated facility location problem through pairing and surrogate constraint analysis.","volume":"8","author":"M.Osorio","year":"2008","journal-title":"WSEAS Transactions on Mathematics"},{"key":"ijeoe.2012010104-32","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601810"},{"key":"ijeoe.2012010104-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.09.005"},{"key":"ijeoe.2012010104-34","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1057\/jors.1991.117","article-title":"A Lagrangian heuristic for the capacitated plant location problem with side constraints.","volume":"42","author":"R.Sridharan","year":"1991","journal-title":"The Journal of the Operational Research Society"},{"key":"ijeoe.2012010104-35","first-page":"1","article-title":"A tabu search heuristic procedure for the capacitated facility location problem.","author":"M.Sun","year":"2008","journal-title":"Journal of Heuristics"},{"key":"ijeoe.2012010104-36","unstructured":"Sun, M., Ducati, E., & Armentano, V. (2007). Solving capacitated facility location problem using tabu search. Proceedings of the ICM, 76-81."},{"key":"ijeoe.2012010104-37","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00105-8"},{"key":"ijeoe.2012010104-38","doi-asserted-by":"crossref","DOI":"10.4018\/978-1-60960-135-5","author":"J.Wang","year":"2011","journal-title":"Supply chain optimization, management and integration: Emerging applications"},{"key":"ijeoe.2012010104-39","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-007-0114-3"},{"key":"ijeoe.2012010104-40","author":"L. A.Wolsey","year":"1999","journal-title":"Integer programming"}],"container-title":["International Journal of Energy Optimization and Engineering"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=62060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T11:48:35Z","timestamp":1654084115000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijeoe.2012010104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,1,1]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijeoe.2012010104","relation":{},"ISSN":["2160-9500","2160-9543"],"issn-type":[{"value":"2160-9500","type":"print"},{"value":"2160-9543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,1]]}}}