A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem

Management Science

Volumn 44, Issue 12 PART 2, 1998, Pages

  Park, June S ^a   Lim, Byung Ha ^a   Lee, Youngho ^a  

^a NONE

Author keywords

Generalized Assignment Problem; Generalized Multi Assignment Problem; Lagrangian Dual Ascent; Lagrangian Dual Based Branch and Bound; Subgradient Search

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

GENERALIZED MULTI-ASSIGNMENT PROBLEMS (GMAP); LAGRANGIAN DUAL-BASED BRANCH-AND-BOUND ALGORITHMS;

SCHEDULING;

EID: 0032292447     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.44.12.s271     Document Type: Article

References (18)

1. Amini, M. M., M. Racer. 1994. A rigorous computational comparison of alternative solution methods for the generalized assignment problem. Management Sci. 40(7) July 868-890.
2. CPLEX Optimization, Inc. 1994. Using the CPLEX Callable Library and CPLEX Mixed Integer Library. CPLEX, Incline Village, NY.
3. De Maio, A., C. Roveda. 1971. An all zero-one algorithm for a certain class of transportation problems. Oper. Res. 19 1406-1418.
4. Dongarra, J. J. 1993. Performance of Various Computers Using Standard Linear Equations Software. Working paper, Math. Sciences Section, Oak Ridge National Laboratory.
5. Fisher, M. L., R. Jaikumar, L. N. Van Wassenhove. 1986. A multiplier adjustment method for the generalized assignment problem. Management Sci. 32(9) September 1095-1103.
6. Geoffrion, A. M. 1974. Lagrangian relaxation for integer programming. Math. Programming 2 82-114.
7. Gottlieb, E. S., M. R. Rao. 1990. The generalized assignment problem: Valid inequalities and facets. Math. Programming 46 31-52.
8. Guignard, M., M. B. Rosenwein. 1989. An improved dual based algorithm for the generalized assignment problem. Oper. Res. 37 July-Aug. 658-663.
9. Ho, C. 1992. Replicated module allocation to capacitated multiprocessors in network-based concurrent processing systems. Ph.D. Thesis, Dept. of Management Sciences, Univ. of Iowa.
10. Laguna, M., J. P. Kelly, J. L. Gonzalez-Velarde, F. Glover. 1995. Tabu search for the multilevel generalized assignment problem. European J. Oper. Res. 82 176-189.
11. Lim, B. H. 1997. Lagrangian dual-based algorithms for network design and assignment problems. Ph.D. Thesis, Dept. of Management Sciences, Univ. of Iowa.
12. Martello, S., P. Toth. 1981. An algorithm for the generalized assignment problem. J. P. Brans, ed. Operational Res. 81 North-Holland, Amsterdam. 589-603.
13. _, _. 1990. Knapsack Problems: Algorithms and Computer implementations. Wiley, New York.
14. Nauss, R. M. 1976. An efficient algorithm for the 0-1 knapsack problem. Management Sci. 23(1) September 27-31.
15. Park, J. S., C. Ho, T. J. Lowe. 1995. Replicated module allocation in LAN-based concurrent processing systems. Telecommunication Systems 3 295-318.
16. _, H. Pirkul. 1995. Optimal configuration of distributed information systems on value-added networks. Working paper, Dept. of Management Sciences, Univ. of Iowa.
17. Ross, G. T., R. M. Soland. 1975. A branch and bound algorithm for the generalized assignment problem. Math. Programming 8 91-103.
18. Trick, M. A. 1991. A linear relaxation heuristic for the generalized assignment problem. Working paper, GSIA, Carnegie Mellon Univ.