Logic cuts for multilevel generalized assignment problems

European Journal of Operational Research

Volumn 151, Issue 1, 2003, Pages 238-246

  Osorio, María A ^a   Laguna, Manuel ^b  

^a BENEMÉRITA UNIVERSIDAD AUTÓNOMA DE PUEBLA   (Mexico)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

Branch and bound; Generalized assignment problem; Knapsack constraints; Logic cuts; Lot sizing

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING;

LOGIC CUTS;

OPERATIONS RESEARCH;

EID: 0041589574     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00576-3     Document Type: Article

References (25)

1. Amini M., Racer M. A hybrid heuristic for the generalized assignment problem. European Journal of Operational Research. 5(2):1995;343-350.
2. Bollapragada, S., Ghattas, O., Hooker, J.N., 1995. Optimal Design of Truss Structures by Mixed Logical and Linear Programming. Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA.
3. Cattrysse D., Van Wassenhove L. A survey of algorithms for the generalized assignment problem. European Journal of Operational Research. 46:1990;84-92.
4. Cattrysse D., Salomon M., Van Wassenhove L. A set partitioning heuristic for the generalized assignment problem. European Journal of Operational Research. 72:1994;167-174.
5. Chu P.C., Beasley J.B. A genetic algorithm for the generalized assignment problem. Computers and OR. 24:1997;17-23.
6. Fisher M.L., Jaikumar R., Van Wassenhove L.N. A multiplier adjustment method for the generalized assignment problem. Management Science. 32(9):1986;1095-1103.
7. Glover F., Jultz H., Klingman D. Improved computer-based planning techniques - part II. Interfaces. 9(4):1979;12-20.
8. Granot F., Hammer P.L. On the use of Boolean functions in linear programming. Methods of Operations Research. 1971;154-184.
9. Guignard M., Rosenwien M. An improved dual based algorithm for the generalized assignment problem. Operations Research. 37(4):1989;658-663.
10. Hooker J.N. Logical inference and polyhedral projection. Proceedings of the Computer Science Logic Workshop (CSL'91). Lecture Notes in Computer Science. vol. 626:1992;. pp. 184-200.
11. Hooker J.N. Generalized resolution for linear inequalities. Annals of Mathematics and AI. 6:1992;271-286.
12. Hooker J.N. Logic-based methods for optimization. Borning A. Principles and Practice of Constraint Programming. Lecture Notes in Computer Science. vol. 874:1994;336-349.
13. Hooker J.N. Logic-Based Methods for Optimization. 2000;Wiley, New York. pp. 101-102.
14. Hooker J.N., Yan H., Grossmann I., Raman R. Logic cuts for processing networks with fixed charges. Computers and Operations Research. 21:1994;265-279.
15. Hooker J.N., Osorio M.A. Mixed logical/linear programming. Discrete Applied Mathematics. 96-97:1999;395-442.
16. Jeroslow R.E. Representability in mixed integer programming, I: Characterization results. Discrete Applied Mathematics. 17:1987;223-243.
17. Laguna M., Kelly J.P., González-Velarde J.L., Glover F. Tabu search for the multilevel generalized assignment problem. European Journal of Operational Research. 82:1995;176-189.
18. Lorena L.A., Narciso N., Marcelo G. Relaxation heuristics for a generalized assignment problem. European Journal of Operational Research. 91(3):1996;600-607.
19. Martello, S., Toth, P., 1981. An algorithm for the generalized assignment problem. In: Proceedings of the 9th IFORS Conference, Hamburg, Germany.
20. Nauss, R.M., 1999. Solving the classical generalized assignment problem. Working Paper. School of Business Administration, University of Missouri, St. Louis, MO.
21. Osorio M.A., Mújica R. Logic cuts generation in a branch and cut framework for location problems. Investigación Operativa. 8(1-3):1999;155-166.
22. Ross G.T., Soland R.M. A branch and bound algorithm for the generalized assignment problem. Mathematical Programming. 8:1975;91-103.
23. Savelsbergh M.W.P. Preprocessing and probing for mixed integer programming problems. ORSA Journal on Computing. 6:1994;445-454.
24. Savelsbergh M. A branch-and-price algorithm for the generalized assignment problem. Operations Research. 45(6):1997;831-854.
25. Wilson J.M. Generating cuts in integer programming with families of specially ordered sets. European Journal of Operational Research. 46:1990;101-108.