Solving the generalised assignment problem using polyhedral results

European Journal of Operational Research

Volumn 108, Issue 3, 1998, Pages 618-628

  Cattrysse, Dirk ^a   Degraeve, Zeger ^a   Tistaert, Jurgen ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b Bank Brussels Lambert   (Belgium)

Author keywords

Branch and bound; Decomposition; Generalised assignment problem; Integer programming; Knapsack polytope

Indexed keywords

CALCULATIONS; CONSTRAINT THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

BRANCH AND BOUND METHOD; DECOMPOSITION METHOD; GENERALIZED ASSIGNMENT PROBLEM; KNAPSACK POLYTOPE;

OPERATIONS RESEARCH;

EID: 0032143311     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00054-4     Document Type: Article

References (17)

1. Balas, E., 1975. Facets of the knapsack polytope. Mathematical Programming 8, 146-164.
2. Balas, E., Zemel, E., 1978. Facets of the knapsack polytope from minimal covers. SIAM Journal on Applied Mathematics 34, 119-148.
3. Benders, J.F., Van Nunen, J.A.E.E., 1983. A property of assignment type mixed integer linear programming problems. Operations Research Letters 2 (2), 47-52.
4. Campbell, J.F., Langevin, A., 1995. The snow disposal assignment problem. Journal of the Operational Research Society 48, 919-929.
5. Cattrysse, D., 1990. Set partitioning approaches to combinatorial optimisation problems. Ph.D. Thesis, K.U. Leuven.
6. Cattrysse, D.G., Van Wassenhove, L.N., 1992. A survey of algorithms for generalised assignment problems. European Journal of Operational Research 60 (3), 260-272.
7. Cattrysse, D.G., Salomon, S., Van Wassenhove, L.N., 1994. A set partitioning heuristic for the generalised assignment problem. European Journal of Operational Research 72 (1), 167-174.
8. Crowder H., Johnson, E.L., Padberg, M., 1983. Solving large-scale zero-one linear programming problems. Operations Research 31 (5), 803-834.
9. Fisher, M.L., Jaikumar, R., Van Wassenhove, L.N., 1986. A multiplier adjustment method for the generalised assignment problem. Management Science 32 (9), 1095-1103.
10. Grigoriadis, M.D., Tang, D.J., Woo, L.S., 1975. Considerations in the optimal synthesis of some communications networks, Paper presented at 45th joint National Meeting of ORSA/TIMS, Boston, MA.
11. Hammer, P.L., Johnson, E.L., Peled, U.N., 1975. Facets of regular 0-1 polytopes. Mathematical Programming 8, 179-206.
12. Martello, S., Toth, P., 1990. Knapsack Problems, Algorithms and Computer Implementations, Wiley Interselence Series in Discrete Mathematics and Optimisation. John Wiley, New York, NY.
13. Nemhauser, G.L., Wolsey, L.A. 1988. Integer and Combinatorial Optimisation, Wiley Interscience Series in Discrete Mathematics and Optimisation. John Wiley, New York, NY.
14. Ross, G.T., Soland, R.M., 1975. A branch and bound algorithm for the generalised assignment problem. Mathematical Programming 8, 91-103.
15. Schrage, L. 1985. Users manual for linear, integer and quadratic programming with LINDO. The Scientific Press, Redwood City, CA.
16. Schrage, L., 1991. An implementation of Gilmore-Gomory's branch and bound procedure for the generalised knapsack problem. Personal Communication.
17. Trick, M.A., 1992. A linear relaxation heuristic for the generalised assignment problem. Naval Research Logistics 39, 137-152.