A Lagrangian heuristics for set-covering problems

A Lagrangian heuristics for set-covering problems

0.00 Avg rating0 Votes
Article ID: iaor19891096
Country: United States
Volume: 37
Issue: 1
Start Page Number: 151
End Page Number: 164
Publication Date: Feb 1990
Journal: Naval Research Logistics
Authors:
Abstract:

This article presents a heuristic algorithm for non-unicost set-covering problems based upon Lagrangian relaxation and subgradient optimization. Computational results, based upon problems involving up to 1000 rows and 10000 columns, indicate that this heuristic produces better-quality results than a number of other heuristics.

Reviews

Required fields are marked *. Your email address will not be published.