TY - JOUR AU - Farhad Djannaty PY - 2002/07/17 Y2 - 2024/03/29 TI - Some useful cost allocation strategies for the shortest route relaxation of the set covering problem JF - Electronic Journal of SADIO (EJS) JA - EJS VL - 4 IS - 1 SE - Papers DO - UR - https://publicaciones.sadio.org.ar/index.php/EJS/article/view/109 AB - Shortest route relaxation (SRR) of the Set Covering Problem (S C P ) is away of relaxing the problem to nd quick lower boundson the value of the objective function. A number of useful cost allocation strategies for the SRR are introduced which are applied to a number of test problems and computational results are presented. ER -