The Maximal Covering Problem with Some Negative Weights Journal Articles

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.

authors

• Berman, Oded
• Drezner, Zvi
• Wesolowsky, George

status

• published 

publication date

• January 2009

has subject area

• 0406 Physical Geography and Environmental Geoscience (FoR)
• 0909 Geomatic Engineering (FoR)
• 1604 Human Geography (FoR)
• Geography (Science Metrix)

published in

• Geographical Analysis  Journal

keywords

• CAPTURE
• COVERAGE
• Geography
• LOCATION PROBLEM
• NETWORK
• Social Sciences

Digital Object Identifier (DOI)

• 10.1111/j.1538-4632.2009.00746.x

start page

• 30

end page

• 42

volume

• 41

issue

• 1