Electronic Journal of SADIO, vol.4, no.1, pp. 14  25 (2002) Some useful cost allocation strategies for the Shortest route relaxation of the set covering Problem
Farhad Djannaty
Abstract Shortest route relaxation (S R R) of the Set Covering Problem (S C P) is a way of relaxing the problem to nd quick lower bounds on the value of the objective function. A number of useful cost allocation strategies for the S R R are introduced which are applied to a number of test problems and computational results are presented.
