Generating Experimental Data for the Generalized Assignment Problem

References

• Amini M. M., Racer M. A rigorous computational comparison of alternative solution methods for the generalized assignment problem. Management Sci. (1994) 40(7):868–890Link, Google Scholar
• Amini M. M., Racer M. A hybrid heuristic for the generalized assignment problem. Eur. J. Oper. Res. (1995) 87:343–348Crossref, Google Scholar
• Balachandran V. An integer generalized transportation model for optimal job assignment in computer networks. Oper. Res. (1976) 24(4):742–759Link, Google Scholar
• Benders J. F., van Nunen J. A. E. E. A property of assignment type mixed integer linear programming problems. Oper. Res. Letters (1983) 2(2):47–52Crossref, Google Scholar
• Cattrysse D. G., Van Wassenhove L. N. A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. (1992) 60:260–272Crossref, Google Scholar
• Cattrysse D. G., Salomon M., Van Wassenhove L. N. A set partitioning heuristic for the generalized assignment problem. Eur. J. Oper. Res. (1994) 72:67–174Crossref, Google Scholar
• Chalmet L., Gelders L., Roubens M. Lagrangean relaxation for a generalized assignment-type problem. Advances in OR (1976) (EURO, North-Holland, Amsterdam, The Netherlands) 103–109Google Scholar
• Chu P. C., Beasley J. E. A genetic algorithm for the generalized assignment problem. Comput. Oper. Res. (1997) 24(1):17–23Crossref, Google Scholar
• CPLEX Reference ManualUsing the CPLEX Callable Library (1998) (ILOG Inc., Incline Village, Nevada) Google Scholar
• De Maio A., Roveda C. An all zero-one algorithm for a certain class of transportation problems. Oper. Res. (1971) 19(6):1406–1418Link, Google Scholar
• Dyer M., Frieze A. Probabilistic analysis of the generalised assignment problem. Math. Programming (1992) 55:169–181Crossref, Google Scholar
• Feo T. A., Resende M. G. C. Greedy randomized adaptive search procedures. J. Global Optim. (1995) 6:109–133Crossref, Google Scholar
• Fisher M. L., Jaikumar R. A generalized assignment heuristic for vehicle routing. Networks (1981) 11:109–124Crossref, Google Scholar
• Fisher M. L., Jaikumar R., Van Wassenhove L. N. A multiplier adjustment method for the generalized assignment problem. Management Sci. (1986) 32(9):1095–1103Link, Google Scholar
• Geoffrion A. M., Graves G. W. Multicommodity distribution system design by Benders decomposition. Management Sci. (1974) 20(5):822–844Link, Google Scholar
• Guignard M., Rosenwein M. B. An improved dual based algorithm for the generalized assignment problem. Oper. Res. (1989) 37(4):658–663Link, Google Scholar
• Hall N. G., Posner M. E. Generating experimental data for computational testing with machine scheduling applications. Oper. Res. (2001) 49:854–865Link, Google Scholar
• Klastorin T. D. On the maximal covering location problem and the generalized assignment problem. Management Sci. (1979) 25(1):107–113Link, Google Scholar
• Lorena L. A. N., Narciso M. G. Relaxation heuristics for a generalized assignment problem. Eur. J. Oper. Res. (1996) 91:600–610Crossref, Google Scholar
• Martello S., Toth P., Brans J. P. An algorithm for the generalized assignment problem. Operational Research '81 (1981) (IFORS, North-Holland, Amsterdam, The Netherlands) 589–603Google Scholar
• Martello S., Toth P.Knapsack Problems, Algorithms and Computer Implementations (1990) (John Wiley & Sons, New York) Google Scholar
• Migdalas A., Pardalos P. M., Storoy S.Parallel Computing in Optimization (1997) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• Osman I. H. Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches. OR Spektrum (1995) 17:211–225Crossref, Google Scholar
• Pardalos P. M., Pitsoulis L. S., Resende M. G. C. Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP. ACM Trans. Math. Software (1997) 23(2):196–208Crossref, Google Scholar
• Piersma N. Combinatorial optimization and empirical processes. (1993) . PhD thesis, Tinbergen Institute, Amsterdam, The NetherlandsGoogle Scholar
• Piersma N., Romeijn H. E. Parallel machine scheduling: A probabilistic analysis. Naval Res. Logist. (1996) 43:897–916Crossref, Google Scholar
• Racer M., Amini M. M. A robust heuristic for the generalized assignment problem. Ann. Oper. Res. (1994) 50:487–503Crossref, Google Scholar
• Resende M. G. C., Pardalos P. M., Li Y. Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Trans. Math. Software (1996) 22(1):104–118Crossref, Google Scholar
• Romeijn H. E., Romero Morales D. A class of greedy algorithms for the generalized assignment problem. Discrete Appl. Math. (2000) 103:209–235Crossref, Google Scholar
• Romeijn H. E., Piersma N. A probabilistic feasibility and value analysis of the generalized assignment problem. J. of Combinatorial Optim. (2000) 4(3):325–355Crossref, Google Scholar
• Ross G. T., Soland R. M. A branch and bound algorithm for the generalized assignment problem. Math. Programming (1975) 8:91–103Crossref, Google Scholar
• Ross G. T., Soland R. M. Modeling facility location problems as generalized assignment problems. Management Sci. (1977) 24(3):345–357Link, Google Scholar
• Savelsbergh M. A branch-and-price algorithm for the generalized assignment problem. Oper. Res. (1997) 45(6):831–841Link, Google Scholar
• Talagrand M. Sharper bounds for Gaussian and empirical processes. Ann. Probab. (1994) 22:28–76Crossref, Google Scholar
• Trick M. A. A linear relaxation heuristic for the generalized assignment problem. Naval Res. Logist. (1992) 39:137–151Crossref, Google Scholar