Some useful cost allocation strategies for the shortest route relaxation of the set covering problem
Abstract
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.
Downloads
Published
Issue
Section
License
Copyright (c) 2002 Farhad Djannaty
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Those authors who have publications with this journal, agree with the following terms:
a. Authors will retain its copyright and will ensure the rights of first publication of its work to the journal, which will be at the same time subject to the Creative Commons Atribución-NoComercial-CompartirIgual 4.0 Internacional (CC BY-NC-SA 4.0) allowing third parties to share the work as long as the author and the first publication on this journal is indicated.
b. Authors may elect other non-exclusive license agreements of the distribution of the published work (for example: locate it on an institutional telematics file or publish it on an monographic volume) as long as the first publication on this journal is indicated,
c. Authors are allowed and suggested to disseminate its work through the internet (for example: in institutional telematics files or in their website) before and during the submission process, which could produce interesting exchanges and increase the references of the published work. (see The effect of open Access)
