A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem

References

• Amini M. M., Racer M. A rigorous computational comparison of alternative solution methods for the generalized assignment problem. Management Sci. (1994) 40(7, July):868–890Link, Google Scholar
• CPLEX Optimization Inc. Using the CPLEX Callable Library and CPLEX Mixed Integer Library. (1994) . CPLEX., Incline Village, NYGoogle Scholar
• De Maio A., Roveda C. An all zero-one algorithm for a certain class of transportation problems. Oper. Res. (1971) 19:1406–1418Link, Google Scholar
• Dongarra J. J. Performance of various computers using standard linear equations software. (1993) . Working paper, Math. Sciences Section, Oak Ridge National LaboratoryGoogle Scholar
• Fisher M. L., Jaikumar R., Van Wassenhove L. N. A multiplier adjustment method for the generalized assignment problem. Management Sci. (1986) 32(9, September):1095–1103Link, Google Scholar
• Geoffrion A. M. Lagrangian relaxation for integer programming. Math. Programming (1974) 2:82–114Crossref, Google Scholar
• Gottlieb E. S., Rao M. R. The generalized assignment problem: Valid inequalities and facets. Math. Programming (1990) 46:31–52Crossref, Google Scholar
• Guignard M., Rosenwein M. B. An improved dual based algorithm for the generalized assignment problem. Oper. Res. (1989) 37(July–Aug):658–663Link, Google Scholar
• Ho C. Replicated module allocation to capacitated multiprocessors in network-based concurrent processing systems. (1992) . Ph.D. thesis Department of Management Sciences, University of IowaGoogle Scholar
• Laguna M., Kelly J. P., Gonzalez-Velarde J. L., Glover F. Tabu search for the multilevel generalized assignment problem. Eur. J. Oper. Res. (1995) 82:176–189Crossref, Google Scholar
• Lim B. H. Lagrangian dual-based algorithms for network design and assignment problems. (1997) . Ph.D. thesis, Department of Management Sciences, University of IowaGoogle Scholar
• Martello S., Toth P., Brans J. P. An algorithm for the generalized assignment problem. Oper. Res. (1981) 81(North-Holland, Amsterdam) 589–603Google Scholar
• Martello S., Toth P.Knapsack Problems: Algorithms and Computer Implementations (1990) (Wiley, New York) Google Scholar
• Nauss R. M. An efficient algorithm for the 0-1 knapsack problem. Management Sci. (1976) 23(1, September):27–31Link, Google Scholar
• Park J. S., Ho C., Lowe T. J. Replicated module allocation in LAN-based concurrent processing systems. Telecommunication Systems (1995) 3:295–318Crossref, Google Scholar
• Park J. S., Pirkul H. Optimal configuration of distributed information systems on value-added networks. (1995) . Working paper, Department of Management Sciences, University of IowaGoogle 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
• Trick M. A. A linear relaxation heuristic for the generalized assignment problem. (1991) . Working paper, GSIA, Carnegie Mellon UniversityGoogle Scholar