The gradual covering problem Journal Articles

abstract

• AbstractIn this paper we investigate the gradual covering problem. Within a certain distance from the facility the demand point is fully covered, and beyond another specified distance the demand point is not covered. Between these two given distances the coverage is linear in the distance from the facility. This formulation can be converted to the Weber problem by imposing a special structure on its cost function. The cost is zero (negligible) up to a certain minimum distance, and it is a constant beyond a certain maximum distance. Between these two extreme distances the cost is linear in the distance. The problem is analyzed and a branch and bound procedure is proposed for its solution. Computational results are presented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004

authors

• Drezner, Zvi
• Wesolowsky, George
• Drezner, Tammy

status

• published 

publication date

• September 2004

has subject area

• 0102 Applied Mathematics (FoR)
• 0103 Numerical and Computational Mathematics (FoR)
• 1503 Business and Management (FoR)
• Logistics & Transportation (Science Metrix)

published in

• Naval Research Logistics  Journal

keywords

• FACILITY
• LOCATION PROBLEM
• Operations Research & Management Science
• Science & Technology
• Technology
• cellular transmitters
• covering problem
• global optimization
• single facility

Digital Object Identifier (DOI)

• 10.1002/nav.20030

start page

• 841

end page

• 855

volume

• 51

issue

• 6