Article ID: | iaor19962249 |
Country: | United States |
Volume: | 43 |
Issue: | 3 |
Start Page Number: | 435 |
End Page Number: | 461 |
Publication Date: | Apr 1996 |
Journal: | Naval Research Logistics |
Authors: | Camm Jeffrey D., Downs Brain T. |
This article develops a robust, exact algorithm for the maximal covering problem (MCP) using dual-based solution methods and greedy heuristics in branch and bound. Based on tests using randomly generated problems with problem parameters similar to those in the existing literature, the hybrid approach developed in this work appears to be effective over a wide range of MCP model parameters. The method is further validated on problems constructed from three real-world data sets. The extensive computational study compares the new method with other existing exact methods using problems that are as big, or larger than, those used in previous work on MCP. The results show that the proposed method is effective in most instances of MCP. In particular, it is shown that bounding schemes using Lagrangian relaxation are effective on MCP as a method of obtaining both exact and heuristic solutions.