An exact method with variable fixing for solving the generalized assignment problem

Computational Optimization and Applications

Volumn 52, Issue 3, 2012, Pages 629-644

  Posta, Marius ^a   Ferland, Jacques A ^a   Michelon, Philippe ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITY OF AVIGNON   (France)

Author keywords

Branch and bound; Dynamic programming; Generalized assignment problem; Integer programming; Lagrangian relaxation

Indexed keywords

BRANCH AND BOUNDS; DECISION PROBLEMS; DEPTH FIRST; DYNAMIC PROGRAMMING ALGORITHM; EXACT ALGORITHMS; EXACT METHODS; GENERALIZED ASSIGNMENT PROBLEM; LAGRANGIAN; LAGRANGIAN RELAXATION; OPTIMIZATION PROBLEMS; REDUCED COST; SEARCH TREES; VARIABLE FIXING;

ALGORITHMS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING;

DYNAMIC PROGRAMMING;

EID: 84865257860     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-011-9432-0     Document Type: Article

References (15)

1. Atamtürk, A., Savelsbergh, M.W.P.: Integer-programming software systems. Ann. Oper. Res. 140(1), 67-124 (2005)
2. Avella, P., Boccia, M., Vasilyev, I.: A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45(3), 543-555 (2010)
3. Beasley, J.E.: Generalised assignment problem test data sets. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/gapinfo.html
4. Diaz, J.A., Fernandez, E.: A tabu search heuristic for the generalized assignment problem. Eur. J. Oper. Res. 132(1), 22-38 (2001)
5. Frangioni, A.: Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Comput. Oper. Res. 23(11), 1099-1118 (1996)
6. Haddadi, S., Ouzia, H.: Effective algorithm and heuristic for the generalized assignment problem. Eur. J. Oper. Res. 153(1), 184-190 (2004)
7. Karabakal, N., Bean, J.C., Lohmann, J.R.: A steepest descent multiplier adjustment method for the generalized assignment problem. Technical report, University of Michigan (1992)
8. Nauss, R.M.: Solving the generalized assignment problem: an optimizing and heuristic approach. INFORMS J. Comput. 15(3), 249-266 (2003)
9. Pigatti, A., de Aragao, M.P., Uchoa, E.: Stabilized branch-and-cut-and- price for the generalized assignment problem. Electron. Notes Discrete Math. 5, 389-395 (2005)
10. Pisinger, D.: A minimal algorithm for the 0-1 knapsack problem. Oper. Res. 45(5), 758-767 (1997)
11. Ross, G.T., Soland, R.M.: A branch and bound algorithm for the generalized assignment problem. Math. Program. 8(1), 91-103 (1975)
12. Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6), 831-841 (1997)
13. Wolsey, L.A.: Integer Programming. Wiley, New York (1998)
14. Yagiura, M., Ibaraki, T., Glover, F.: An ejection chain approach for the generalized assignment problem. INFORMS J. Comput. 16(2), 133-151 (2004)
15. Yagiura, M., Ibaraki, T., Glover, F.: A path relinking approach with ejection chains for the generalized assignment problem. Eur. J. Oper. Res. 169(2), 548-569 (2006)