Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
We present an implementation of the Cross Decomposition method to solve the capacitated facility location problem. The method unifies Benders Decomposition and Lagrangean relaxation into a single framework that involves successive solutions to a transportation problem and a simple plant location problem. Computational tests on problems with as many as 100 candidate facility locations and 200 customers provide evidence that the approach is superior to several other methods. The specialized Cross Decomposition program is, on a common set of test problems, about ten times faster than several recently developed programs. We also present a simple algorithm to strengthen Benders cuts.
Operations Research – INFORMS
Published: Feb 1, 1986
Keywords: Keywords : 185 facility location ; 625 cross decomposition for mixed integer programming
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.