In this paper two k-shortest path methods are reformulated for determining the optimal solution of a generalized assignment problem. On the contrary, one is quite capable of dealing with lower capacitated problems while the other with higher ones. Computation study on the random problems gives the further comparisons and the effects of model capacity on the feasibility.
Relation:
Journal of information & optimization sciences 19(2), pp.15-171
