Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach

References

• Amini M., Racer M. A rigorous computational comparison of alternative solution methodologies for the generalized assignment problem. Management Sci. (1994) 40:868–890Link, Google Scholar
• Balachandran V. An integer generalized transportation model for optimal job assignment in computer networks. (1972) . Working Paper 34-72-3, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PAGoogle Scholar
• Balas E., Jeroslow R. Canonical cuts in the unit hypercube. SIAM J. Appl. Math. (1972) 23:61–69Crossref, Google Scholar
• Barr R., Golden B., Kelly J., Resende M., Stewart W. Designing and reporting on computational experiments with heuristic methods. J. Heuristics (1995) 1:9–32Crossref, Google Scholar
• Cattrysse D., Degraeve Z., Tistaert J. Solving the generalized assignment problem using polyhedral results. Eur. J. Oper. Res. (1998) 108:618–628Crossref, Google Scholar
• Cattrysse D., Salomon M., Van Wassenhove L. A set partitioning heuristic for the generalized assignment problem. Eur. J. Oper. Res. (1994) 72:167–174Crossref, Google Scholar
• Cattrysse D., Van Wassenhove L. A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. (1992) 60:260–272Crossref, Google Scholar
• Chu P. C., Beasley J. B. A genetic algorithm for the generalized assignment problem. Comput. Oper. Res. (1997) 24:17–23Crossref, Google Scholar
• Fisher M., Jaikumar R. A generalized assignment heuristic for vehicle routing. Networks (1981) 11:109–124Crossref, Google Scholar
• Gavish B., Pirkul H. Algorithms for the multi-resource generalized assignment problem. Management Sci. (1991) 37:695–713Link, Google Scholar
• Geoffrion A. M. Lagrangean relaxation for integer programming. Math. Programming Study: Approaches to Integer Programming (1974) 2:82–114Crossref, Google Scholar
• Geoffrion A. M., Marsten R. E. Integer programming algorithms: A framework and state-of-the-art survey. Management Sci. (1972) 18:465–491Link, Google Scholar
• Gottlieb E., Rao M. The generalized assignment problem: Valid inequalities and facets. Math. Programming (1990) 46:31–52Crossref, Google Scholar
• Guignard M., Rosenwein M. An improved dual based algorithm for the generalized assignment problem. Oper. Res. (1989) 37:658–663Link, Google Scholar
• Guignard M., Zhu S. A two phase dual algorithm for solving Lagrangean duals in mixed integer programming. (1996) . Working paper, The Wharton School, University of Pennsylvania, Philadelphia, PAGoogle Scholar
• Laguna M., Kelly J., Gonzalez-Velarde J., Glover F. Tabu search for the multilevel generalized assignment problem. Eur. J. Oper. Res. (1995) 82:176–189Crossref, Google Scholar
• Marsten R. The design of the XMP linear programming library. (1980) . Technical Report, 80-2, Department of Management Information Systems, University of Arizona, Tucson, AZGoogle Scholar
• Martello S., Toth P., Brans J. P. An algorithm for the generalized assignment problem. Oper. Res. 81 (1981) (North-Holland, Amsterdam, The Netherlands)589–603Google Scholar
• Martello S., Toth P.Knapsack Problems, Algorithms, and Computer Implementations (1990) (John Wiley and Sons, New York) Google Scholar
• Mazzola J., Neebe A., Dunn C. Production planning of a flexible manufacturing system in a material requirements planning environment. Internat. J. Flexible Manufacturing Systems (1989) 1/2:115–142Google Scholar
• Nauss R. M. An efficient algorithm for the 0–1 knapsack problem. Management Sci. (1976) 23:27–31Link, Google Scholar
• Park J. S., Lim B. H., Lee Y. A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem. Management Sci. (1998) 44:271–282Link, Google Scholar
• Ronen D. Allocation of trips to trucks operating from a single terminal. Comput. Oper. Res. (1992) 19:129–138Crossref, Google Scholar
• Ross G. T., Soland R. M. A branch and bound algorithm for the generalized assignment problem. Math. Programming (1975) 8:91–103Crossref, Google Scholar
• Ross G. T., Soland R. M. Modeling facility location problems as generalized assignment problems. Management Sci. (1977) 24:345–357Link, Google Scholar
• Savelsbergh M. A branch-and-price algorithm for the generalized assignment problem. Oper. Res. (1997) 45:831–841Link, Google Scholar
• Watcom FORTRAN 77 User's Guide (1995) (Watcom International Corp., Waterloo, Ontario, Canada) Google Scholar