Solving capacitated facility location problems by Fenchel cutting planes

M T Ramos and J Sáez ()
Additional contact information
M T Ramos: Universidad de Valladolid
J Sáez: Universidad de Valladolid

Journal of the Operational Research Society, 2005, vol. 56, issue 3, 297-306

Abstract: Abstract In this paper, we apply the Fenchel cutting planes methodology to Capacitated Facility Location problems. We select a suitable knapsack structure from which depth cuts can be obtained. Moreover, we simultaneously obtain a primal heuristic solution. The lower and upper bounds achieved by our procedure are compared with those provided by Lagrangean relaxation of the demand constraints. As the computational results show the Fenchel cutting planes methodology outperforms the Lagrangean one, both in the obtaining of the bounds and in the effectiveness of the branch and bound algorithm using each relaxation as the initial formulation.

Keywords: location; integer programming; cutting planes; heuristics (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601810 Abstract (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:pal:jorsoc:v:56:y:2005:i:3:d:10.1057_palgrave.jors.2601810

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601810

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().