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 algorithm for a mixed set covering/partitioning model that includes as special cases the well-known set covering problem and set partitioning problem. The novel feature of our algorithm is the use of continuous heuristics applied to the dual of the linear programming relaxation to provide lower bounds for a branch and bound algorithm. The heuristics are continuous adaptations of the well-known greedy and 3-opt methods that have been applied to a variety of combinatorial optimization problems. Our algorithm has outperformed the current best set covering algorithm of Balas and Ho (1980) by about a factor of 3, and appears to improve on the best existing set partitioning algorithm by more than an order of magnitude.
Management Science – INFORMS
Published: Jun 1, 1990
Keywords: Keywords : set covering ; set partitioning ; optimization ; Lagrangean relaxation
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.