Consider the following problem. Our primary objective is to maximize the number of covered demands. As in the maximum covering model, demands will be covered if there is at least one facility within Dcdistance units of the demand node. Our secondary objective is to minimize the demand-weighted distance between a demand node and the facility to which the demand node is assigned for those demands that are assigned to a facility more than Dcdistance units away.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here