Effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance

Management Science

Volumn 46, Issue 2, 2000, Pages 302-317

  Hill, Raymond R ^a   Reilly, Charles H ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CORRELATION METHODS; HEURISTIC METHODS; PROBLEM SOLVING;

COEFFICIENT CORRELATION STRUCTURE; RANK CORRELATION INDUCTION; TWO DIMENSIONAL KNAPSACK PROBLEM;

MANAGEMENT SCIENCE;

EID: 0033884510     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.46.2.302.11930     Document Type: Article

References (41)

1. Amini, M. M., M. Racer. 1994. A rigorous computational comparison of alternative solution methods for the generalized assignment problem. Management Sci. 40(7) 868-890.
2. Balas, E., C. H. Martin. 1980. Pivot and complement - A heuristic for 0-1 programming. Management Sci. 26(1) 86-96.
3. _, E. Zemel. 1980. An algorithm for large zero-one knapsack problems. Oper. Res. 28(5) 1130-1154.
4. Cario, M. C., J. Clifford, R. Hill, J. Yang, K. Yang, C. Reilly. 1995. Alternative methods for generating synthetic generalized assignment problems. B. Schmeiser and R. Uzsoy, eds. Proc. 4th Indust. Engrg. Res. Conf. 1080-1089.
5. Drexl, A. 1988. A simulated annealing approach to the multiconstraint zero-one knapsack problem. Comput. 40 1-8.
6. Fisher, M., R. Jaikumar, L. Van Wassenhove. 1986. A multiplier adjustment method for the generalized assignment problem. Management Sci. 32(9) 1095-1103.
7. Fréville, A., G. Plateau. 1993. An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem. European J. Oper. Res. 68(3) 413-421.
8. _, _. 1994. An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem. Discrete Appl. Math. 49 189-212.
9. _, _. 1996. The 0-1 bi-dimensional knapsack problem: Toward an efficient high-level primitive tool. J. Heuristics 2(2) 147-167.
10. Frieze, A. M., M. R. B. Clarke. 1984. Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses. European J. Oper. Res. 15 100-109.
11. Guignard, M., M. B. Rosenwein. 1989. An improved dual based algorithm for the generalized assignment problem. Oper. Res. 37(4) 658-663
12. Hanafi, S., A. Fréville. 1998. An efficient tabu search for the multiconstraint zero-one knapsack problem. European J. Oper. Res. 106 659-675.
13. Hill, R. R. 1996. Multivariate sampling with explicit correlation induction for simulation and optimization studies. Ph.D. Dissertation, Department of Industrial, Welding and Systems Engineering, The Ohio State University, Columbus, OH.
14. _. 1998. An Analytical Comparison of Optimization Problem Generation Methodologies. D. J. Medeiros, E. F. Watson, J. S. Carson, M. S. Manivannan, eds. Proc. 1998 Winter Simulation Conf., Institute of Electrical and Electronics Engineers, Washington, D.C. 609-615.
15. _, C. H. Reilly. 1994. Composition for multivariate random variables. J. T. Tew, S. Manivannan, D. A. Sadowski, A. F. Seila, eds. Proc. 1994 Winter Simulation Conf. Institute of Electrical and Electronics Engineers, Orlando, FL. 332-342.
16. Hooker, J. N. 1994. Needed: An empirical science of algorithms. Oper. Res. 42(2) 201-212.
17. Iman, R. L., W. J. Conover. 1982. A distribution-free approach to inducing rank correlation among input variables. Comm. Statist.: Simulation Comput. 11(3) 311-334.
18. John, T. C. 1989. Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty. Comput. Oper. Res. 16(5) 471-479.
19. Lokketangen, A., F. Glover. 1998. Solving zero-one mixed integer programming problems using tabu search. European J. Oper. Res. 106 624-658.
20. Loulou, R., E. Michaelides. 1979. New greedy heuristics for the multidimensional 0-1 knapsack problem. Oper. Res. 27(6) 1101-1114.
21. Martello, S., P. Toth. 1979. The 0-1 knapsack problem. N. Christofides, A. Mingozzi, C. Sandi, eds. Combinatorial Optimization, John Wiley and Sons, New York. 237-279.
22. _, _. 1981. An algorithm for the generalized assignment problem. J. P. Brans, ed., Operational Research '81. North-Holland, Amsterdam. 589-603.
23. _, _. 1988. A new algorithm for the 0-1 knapsack problem. Management Sci. 34(5) 633-644.
24. _, _. 1997. Upper bounds and algorithms for hard 0-1 knapsack problems. Oper. Res. 45(5) 768-778.
25. Mazzola, J. B., A. W. Neebe. 1993. An algorithm for the bottleneck generalized assignment problem. Comput. Oper. Res. 20(4) 355-362.
26. Moore, B., J. Peterson, C. Reilly. 1990. Characterizing distributions of discrete bivariate random variables for simulation and evaluation of solution methods. O. Balci, R. Sadowski, R. Nance, eds. Proc. 1990 Winter Simulation Conf. Institute of Electrical and Electronics Engineers, New Orleans, LA. 294-302.
27. _, C. H. Reilly. 1993. Randomly generating synthetic optimization problems with explicitly induced correlation. OSU/ISE Working Paper, Series Number 1993-002. The Ohio State University, Columbus, OH.
28. Pirkul, H. 1987. A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Naval Res. Logist. 34(2) 161-172.
29. Pollock, G. A. 1992. Evaluation of solution methods for weighted set covering problems generated with correlated uniform random variables. Undergraduate Honors Thesis, Department of Industrial and Systems Engineering, The Ohio State University, Columbus, OH.
30. Potts, C. N., L. N. Von Wassenhove. 1988. Algorithms for scheduling a single machine to minimize the weighted number of late jobs. Management Sci. 34(7) 843-858.
31. _, _. 1992. Single machine scheduling to minimize total late work. Oper. Res. 40(3) 586-595.
32. Reilly, C. H. 1991. Optimization test problems with uniformly distributed coefficients. B. L. Nelson, W. D. Kelton, G. M. Clark, eds. Proc. of the 1991 Winter Simulation Conf. Institute of Electrical and Electronics Engineers, Phoenix, AZ. 866-874.
33. _. 1997a. Generating coefficients for optimization test problems with implicit correlation induction. Proc. 1997 IEEE Internat. Conf. Systems, Man, Cybernetics 3 2438-2443.
34. _. 1997b. Why are knapsack problems with correlated coefficients harder to solve? Presentation, INFORMS Spring 1997 Meeting (May 7) San Diego, CA.
35. _. 1998. Properties of synthetic optimization problems. D. J. Medeiros, E. F. Watson, J. S. Carson, M. S. Manivannan, eds. Proc. 1998 Winter Simulation Conf. Institute of Electrical and Electronics Engineers, Washington DC. 617-621.
36. Saltzman, M. J. 1994. Survey: Mixed integer programming. OR/MS Today 21(2) 42-51.
37. Thiel, J., S. Voss. 1994. Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms. Comput. 32(4) 226-242.
38. Toyoda, Y. 1975. A simplified algorithm for obtaining approximate solutions to zero-one programming problems. Management Sci. 21(12) 1417-1427.
39. Trick, M. 1992. A linear relaxation heuristic for the generalized assignment problem. Naval Res. Logist. 39(2) 137-151.
40. Yang, J. 1994. A computational study on 0-1 knapsack problems generated under explicit correlation induction. MS Thesis, Department of Industrial and Systems Engineering, The Ohio State University, Columbus, OH.
41. Zanakis, S. H. 1977. Heuristic 0-1 linear programming: An experimental comparison of three methods. Management Sci. 24 91-104.