Some useful cost allocation strategies for the shortest route relaxation of the set covering problem

  • Farhad Djannaty Kurdistan University,Sanandaj

Resumen

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.

Publicado
2002-07-17
Cómo citar
Djannaty, F. (2002). Some useful cost allocation strategies for the shortest route relaxation of the set covering problem. Electronic Journal of SADIO (EJS), 4(1), 14-25. Recuperado a partir de https://ojs.sadio.org.ar/index.php/EJS/article/view/109