An LP-based heuristic procedure for the generalized assignment problem with special ordered sets

Computers and Operations Research

Volumn 34, Issue 8, 2007, Pages 2359-2369

  French, Alan P ^a   Wilson, John M ^a  

^a LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

Assignment; Generalized assignment; Heuristics; Special ordered sets

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; SET THEORY;

COMBINATORIAL PROBLEMS; COMPUTATIONAL TESTING; GENERALIZED ASSIGNMENT; SPECIAL ORDERED SETS;

HEURISTIC METHODS;

EID: 33846039835     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.09.008     Document Type: Article

References (19)

1. Beale E.M.L., and Tomlin J.A. Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables. In: Lawrence J. (Ed). OR 69: Proceedings of the fifth international conference on operational research, Venice, 1969 (1970), Tavistock Publications, London 447-454
2. Beale E.M.L., and Forrest J.J.H. Global optimization using special ordered sets. Mathematical Programming 10 (1976) 52-69
3. de Farias Jr I.R., Johnson E.L., and Nemhauser G.L. A generalized assignment problem with special odered sets: a polyhedral approach. Mathematical Programming 89 (2000) 187-203
4. Wilson J.M. An algorithm for the generalized assignment problem with special ordered sets. Journal of Heuristics 11 (2005) 337-350
5. Diaz J.A., and Fernandez E. A tabu search heuristic for the generalized assignment problem. European Journal of Operational Research 132 (2001) 22-38
6. Higgins A.J. A dynamic tabu search for large-scale generalised assignment problems. Computer and Operations Research 28 (2001) 1039-1048
7. Yagiura M, Ibaraki T, Glover F. A path relinking approach for the generalized assignment problem. Proceedings of international symposium on scheduling, Japan, June 4-6, 2002, p. 105-8.
8. Yagiura M., Ibaraki T., and Glover F. An ejection chain approach for the generalized assignment problem. INFORMS Journal of Computing 16 (2004) 133-151
9. Nauss R.M. Solving the generalized assignment problem: an optimizing and heuristic approach. INFORMS Journal of Computing 15 (2003) 249-266
10. Haddadi S., and Ouzia H. Effective algorithm for the generalized assignment problem. European Journal of Operational Research 153 (2004) 184-190
11. Osorio M.A., and Laguna M. Logic cuts for multilevel generalized assignment problems. European Journal of Operational Research 151 (2003) 238-246
12. Yagiura M., Iwasaki S., Ibaraki T., and Glover F. A very large-scale neighbourhood search algorithm for the multi-resource generalized assignment problem. Discrete Optimization 1 (2004) 87-98
13. MP, Dash optimization, Blisworth, Northamptonshire, England.
14. Trick M.A. A linear relaxation heuristic for the generalised assignment problem. Naval Research Logistics 39 (1992) 137-151
15. Savelsbergh M. A branch-and-price algorithm for the generalized assignment problem. Operations Research 45 (1997) 831-841
16. Martello S., and Toth P. Knapsack problems: algorithms and computer implementations (1990), Wiley, Chichester, England
17. Cattrysse S., Degraeve Z., and Tistaert J. Solving the generalized assignment problem using polyhedral results. European Journal of Operational Research 108 (1998) 618-628
18. Ross G.T., and Soland R.M. A branch and bound algorithm for the generalized assignment problem. Mathematical Programming 8 (1975) 91-103
19. Laguna M., Kelly J., Gonzalez-Velarde J., and Glover F. Tabu search for the multilevel generalized assignment problem. European Journal of Operational Research 82 (1995) 176-189