1. D. Applegate, R. Bixby, V. Chvatal and W. Cook
"Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems"
Math. Program., vol. 97, no. 1–2, pp. 91-153, 2003
2. Y. Asahiro, M. Ishibashi and M. Yamashita
"Independent and cooperative parallel search methods for the generalized assignment problem"
Optim. Methods Softw., vol. 18, no. 2, pp. 129-141, 2003
3. P. Avella and M. Boccia
"A cutting plane algorithm for the capacitated facility location problem"
Comput. Optim. Appl., vol. 43, no. 1, pp. 39-65, 2009
4. P. Avella, M. Boccia and I. Vasilyev
"Computational experience with general cutting planes for the set covering problem"
Operat. Res. Lett., vol. 39, no. 1, pp. 16-20, 2009
5. P. Avella, M. Boccia and I. Vasilyev
"A computational study of exact knapsack separation for the generalized assignment problem"
Comput. Optim. Appl., vol. 45, no. 3, pp. 543-555, 2010
6. P. Avella, M. Boccia and I. Vasilyev
"Computational testing of a separation procedure for the knapsack set with a single continuous variable"
INFORMS J. Comput., vol. 24, no. 1, pp. 165-171, 2012
7. M. Boccia, A. Sforza, C. Sterle and I. Vasilyev
"A cut and branch approach for the capacitated p-median problem based on fenchel cutting planes"
J. Math. Modell. Algorithms, vol. 7, no. 1, pp. 43-58, 2008
8. E. A. Boyd
"Generating Fenchel cutting planes for knapsack polyhedra"
SIAM J. Optim., vol. 3, no. 4, pp. 734-750, 1993
9. A. Ceselli and G. Righini
"A branch-and-price algorithm for the multilevel generalized assignment problem"
Operat. Res., vol. 54, no. 6, pp. 1172-1184, 2006
10. P. C. Chu and J. E. Beasley
"A genetic algorithm for the generalised assignment problem"
Comput. Operat. Res., vol. 24, no. 1, pp. 17-23, 1997
11. Using the CPLEX Callable Library
2010, IBM ILOG AMPL, New York, NY USA
12. I. R. De Farias and G. L. Nemhauser
"A family of inequalities for the generalized assignment polytope"
Operat. Res. Lett., vol. 29, no. 2, pp. 49-51, 2001
13. A. P. French and J. M. Wilson
"Heuristic solution methods for the multilevel generalized assignment problem"
J. Heurist., vol. 8, no. 2, pp. 143-153, 2002
14. R. Fukasawa and M. Goycoolea
"On the exact separation of mixed integer knapsack cuts"
Math. Program., vol. 128, no. 1–2, pp. 19-41, 2011
15. F. Glover, J. Hultz and D. Klingman
"Improved computer-based planning techniques. Part II"
Interfaces, vol. 9, no. 4, pp. 12-20, 1979
16. E. S. Gottlieb and M. R. Rao
"The generalized assignment problem: Valid inequalities and facets"
Math. Program., vol. 46, no. 1–3, pp. 31-52, 1990
17. E. S. Gottlieb and M. R. Rao
"(1,k)-configuration facets for the generalized assignment problem"
Math. Program., vol. 46, no. 1–3, pp. 53-60, 1990
18. S. Hajri-Gabouj
"A fuzzy genetic multiobjective optimization algorithm for a multilevel generalized assignment problem"
IEEE Trans. Syst., Man Cybern. C, Appl. Rev., vol. 33, no. 2, pp. 214-224, May, 2003, IEEE
19. K. Kaparis and A. N. Letchford
"Separation algorithms for 0–1 knapsack polytopes"
Math. Program., vol. 124, no. 1–2, pp. 69-91, 2010
20. M. Laguna, J. P. Kelly, J. L. Gonzales-Velarde and F. Glover
"Tabu search for the multilevel generalized assignment problem"
Eur. J. Operat. Res., vol. 82, no. 1, pp. 176-189, 1995
21. R. M. Nauss
"Solving the generalized assignment problem: An optimizing and heuristic approach"
INFORMS J. Comput., vol. 15, no. 3, pp. 249-266, 2003
22. T. Oncan
"A survey of the generalized assignment problem and its applications"
Inf. Syst. Operat. Res., vol. 43, no. 3, pp. 123-141, 2007
23. I. H. Osman
"Heuristics for the generalized assignment problem: Simulated annealing and tabu search approaches"
Operat. Res. Spektrum, vol. 17, no. 4, pp. 211-225, 1995
24. M. A. Osorio and M. Laguna
"Logic cuts for multilevel generalized assignment problems"
Eur. J. Operat. Res., vol. 151, no. 1, pp. 1238-1246, 2003
25. M. W. Padberg
"On the facial structure of set packing polyhedra"
Math. Program., vol. 5, no. 1, pp. 199-215, 1973
26. A. Pigatti, M. P. de Aragao and E. Uchoa
"Stabilized branch-and-cut-and-price for the generalized assignment problem"
Discrete Math., vol. 19, no. 1, pp. 389-395, 2005
27. D. Pisinger
"A minimal algorithm for the 0–1 knapsack problem"
Operat. Res., vol. 45, no. 5, pp. 758-767, 1995
28. M. Posta, J. A. Ferland and P. Michelon
"An exact method with variable fixing for solving the generalized assignment problem"
Comput. Optim. Appl., vol. 52, no. 3, pp. 629-644, 2012
29. L. A. Wolsey
"Facets and strong valid inequalities for integer programs"
Operat. Res., vol. 24, no. 2, pp. 367-372, 1976
30. M. Yagiura, T. Ibaraki and F. Glover
"An ejection chain approach for the generalized assignment problem"
INFORMS J. Comput., vol. 16, no. 2, pp. 133-151, 2004
31. M. Yagiura, T. Ibaraki and F. Glover
"A path relinking approach with ejection chains for the generalized assignment problem"
Eur. J. Operat. Res., vol. 169, no. 2, pp. 548-569, 2006
32. M. Yagiura, T. Yamaguchi and T. Ibaraki
"A variable depth search algorithm with branching search for the generalized assignment problem"
Optim. Methods Softw., vol. 10, no. 2, pp. 419-441, 1998