The Maximal Covering Problem with Some Negative Weights |
| |
| Authors: | Oded Berman Zvi Drezner George O Wesolowsky |
| |
| Institution: | Joseph L. Rotman School of Management, University of Toronto, Toronto, ON, Canada,;College of Business and Economics, California State University-Fullerton, Fullerton, CA,;Faculty of Business, McMaster University, Hamilton, ON, Canada |
| |
| Abstract: | This article presents the maximal covering problem on a network when some of the weights can be negative. Integer programming formulations are proposed and tested with ILOG CPLEX. Heuristic algorithms, an ascent algorithm, and simulated annealing are proposed and tested. The simulated annealing approach provides the best results for a data set comprising 40 problems. |
| |
| Keywords: | |
|
|
