Empirical comparison between two k-shortest path methods for the generalized assignment problem

References

• Amini , M. M. and Racer , M. 1994 . A rigorous computational comparison of alternative solution methods for the generalized assignment problem . Management Science , 40 : 868 – 890 .
   Web of Science ®Google Scholar
• Azevedo , J. A. D. , Costa , M. E. O. S. , Madeira , J. J. E. R. S. and Martins , E. Q. V. 1993 . An algorithm for the ranking of shortest paths . European Journal of Operational Research , 69 : 97 – 105 .
   Web of Science ®Google Scholar
• Azevedo , J. A. D. , Madeira , J. J. E. R. S. , Martins , E. Q. V. and Pires , F. M. A. A. 1994 . A computational improvement for a shortest paths ranking algorithm . European Journal of Operational Research , 73 : 188 – 191 .
   Google Scholar
• Balachandran , V. C. and Steinberg , D. I. 1976 . An integer generalized transportation model for optimal job assignment of computer network . Operations Research , 24 : 729 – 759 .
   Google Scholar
• Carreno , J. J. 1990 . Economic lot scheduling for multiple products on parallel identical processors . Management Science , 36 : 348 – 358 .
   Web of Science ®Google Scholar
• Cattrysse , D. G. and Van Wassenhove , L. N. 1992 . A survey of algorithms for the generalized assignment problem . European Journal of Operational Research , 60 : 260 – 272 .
   Web of Science ®Google Scholar
• Cattrysse , D. G. 1994 . M. Salomon and L. N. Van Wassenhove, A set partitioning heuristic for the generalized assignment problem . European Journal of Operational Research , 72 : 167 – 174 .
   Web of Science ®Google Scholar
• Fisher , M. L. and Jaikumar , R. 1981 . A generalized assignment heuristic for vehicle routing . Network , 11 : 109 – 124 .
   Google Scholar
• Fisher , M. L. 1986 . R. Jaikumar and L. N. Van Wassenhove, An multiplier adjustment method for the generalized assignment problem . Management Science , 32 : 1095 – 1103 .
   Web of Science ®Google Scholar
• Gondran , M. and Minoux , M. 1984 . Graphs and algorithms , New York : John Wiley and Sons .
   Google Scholar
• Grigoriadis , M. G. , Tang , D. J. and Woo , L. S. Considerations in optimal synthesis of communications networks . 45th Joint Meeting of ORSA/TIMS . Boston . paper presented at
   Google Scholar
• Guignard , M. and Rosenwein , M. B. 1989a . An improved dual based algorithm for the generalized assignment problem . Operations Research , 37 : 197 – 205 .
   Google Scholar
• Jörnsten , K. and Näsberg , M. 1986 . A new Lagrangean relaxation approach to the generalized assignment problem . European Journal of Operational Research , 27 : 313 – 323 .
   Web of Science ®Google Scholar
• Klastorin , T. D. 1979 . An effective subgradient algorithm for the generalized assignment problem . Computers and Operations Research , 6 : 155 – 164 .
   Web of Science ®Google Scholar
• Martello , S. and Toth , P. 1981 . “ An algorithm for the generalized assignment problem ” . In Operational Research , Edited by: Brans , J. P. 589 – 603 . Amsterdam : North-Holland . in
   Google Scholar
• Martello , S. and Toth , P. 1987 . Linear assignment problems . Annals of Discrete Mathematics , 31 : 259 – 282 .
   Google Scholar
• Martello , S. and Toth , P. 1990 . Knapsack Problems, algorithms and computer implementations , New York : John Wiley & Sons .
   Google Scholar
• Martins , E. Q. V. 1984 . An algorithm for ranking paths that may contain cycles . European Journal of Operational Research , 18 : 123 – 130 .
   Web of Science ®Google Scholar
• Mazolla , J. B. , Neebe , A. W. and Dunn , C. V. R. 1989 . Production planning of a flexible manufacturing system in a material requirements planning environment . International Journal of Flexible Manufacturing System , 1 : 115 – 142 .
   Google Scholar
• Ross , G. T. and Şoland , R. M. 1975 . A branch and bound algorithm for the generalized assignment problem . Mathematical Programming , 8 : 91 – 105 .
   Web of Science ®Google Scholar
• Ross , G. T. and Soland , R. M. 1977 . Modeling facility location problems as generalized assignment problem . Management Science , 24 : 345 – 357 .
   Web of Science ®Google Scholar
• Shier , S. 1976 . Iterative methods for the determining k-shortest paths in a network . Network , 6 : 205 – 230 .
   Google Scholar
• Trick , M. A. 1992 . A linear relaxation heuristic for the generalized assignment problem . Naval Research Logistic Quarterly , 39 : 137 – 151 .
   Google Scholar
• Welcox , S. P. 1987 . A new multiplier adjustment method for the generalized assignment problem Vol. 2 , Working paper, General Research Corporation, 7655 Old Springhouse Road, McLean, VA
   Google Scholar