Applying Lagrangian relaxation to the resolution of two‐stage location problems

A. Marín and B. Pelegrín

Annals of Operations Research, 1999, vol. 86, issue 0, 179-198

Abstract: A family of two‐stage location problems is considered. These problems involve a systemproviding a choice of depots andyor plants, each with an associated location cost, and a setof demand points which must be supplied, in such a way that the total cost is minimized. Byusing Lagrangian relaxation, lower bounds and heuristic solutions are obtained for two kindsof formulation involving two or three indexes for each transportation variable. The goodnessof both formulations is compared by means of a computational study, and the results forseveral instances are presented. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018998500803 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:86:y:1999:i:0:p:179-198:10.1023/a:1018998500803

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018998500803

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().