Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions

Annals of Operations Research

Volumn 117, Issue 1-4, 2002, Pages 71-93

  Osorio, María A ^a   Glover, Fred ^b   Hammer, Peter ^c  

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

^b UNIVERSITY OF MISSISSIPPI   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Constraint pairing; Duality; Logic cuts; Multidimensional knapsack problem; Surrogate constraints

Indexed keywords

EID: 0036959053     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1021513321301     Document Type: Conference Paper

References (58)

1. R. Aboudi and K. Jörnsten, Tabu search for general zero-one integer programs using the pivot and complement heuristics, ORSA Journal on Computing 6 (1994) 82-93.
2. E. Balas, An additive algorithm for solving linear programs with zero-one variables, Operations Research 13 (1965) 517-546.
3. E. Balas, Discrete programming by the filter method, Operations Research 19 (1967) 915-957.
4. S. Bollapragada, O. Ghattas and J.N. Hooker, Optimal design of truss structures by mixed logical and linear programming, Manuscript, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh (1995).
5. A.V. Cabot, An enumeration algorithm for knapsack problems, Operations Research 18 (1970) 306-311.
6. P. Chu and J. Beasley, A genetic algorithm for the multidimensional knapsack problem, Journal of Heuristics 4 (1998) 63-86.
7. Y. Crama and J. Mazzola, On the strength of relaxations of multidimensional knapsack problems, INFOR 32(4) (1994) 219-225.
8. S. Dammeyer and S. Voss, Dynamic tabu list of management using reverse elimnation method, Annals of Operations Research 41 (1993) 31-46.
9. G.B. Dantzig, Discrete variables problems, Operations Research 5 (1957) 266-277.
10. R. Dembo and P. Hammer, A reduction algorithm for knapsack problems, Methods of Operations Research 36 (1980) 49-60.
11. A. Drexel, A simulated annealing approach to the multiconstraint zero-one knapsack problem, Computing 40 (1988) 1-8.
12. H.E. Dyer, Calculating surrogate constraints, Mathematical Programming 12 (1980) 225-278.
13. J.F. Fontanari, A statistical analysis of the knapsack problem, Journal of Physics A: Mathematical and General 28 (1995) 4751-4759.
14. A. Fréville and G. Plateau, Hard 0-1 multiknapsack test problems for size reduction methods, Investigación Operativa 1 (1990) 251-270.
15. A. Fréville and G. Plateau, An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Discrete Applied Mathematics 49 (1994) 189-212.
16. B. Gavish and H. Pirkul, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Mathematical Programming 31 (1985) 78-105.
17. A. Geoffrion, An improved implicit enumeration approach for integer programming, Operations Research 17 (1969) 437-454.
18. P.C. Gilmore and R.E. Gomory, The theory and computation of knapsack functions, Operations Research 14 (1966) 1045-1075.
19. F. Glover, A multiphase-dual algorithm for the zero-one integer programming problem, Operations Research 13 (1965) 879-919.
20. F. Glover, Surrogate constraints, Operations Research 16 (1968) 741-749.
21. F. Glover, Flows in arborescences, Management Science 17(9) (1971) 568-586.
22. F. Glover, Surrogate constraint duality in mathematical programming, Operations Research 23(3) (1975) 434-451.
23. F. Glover and G.A. Kochenberger, Critical event tabu search for multidimensional knapsack problems, in: Meta-Heuristics: Theory and Applications, eds. I.H. Osman and J.P. Kelly (Kluwer Academic, 1996) pp. 407-427.
24. F. Glover, H. Sherali and Y. Lee, Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming, Computational Optimization and Applications 8 (1997) 151-172.
25. F. Granot and P.L. Hammer, On the use of Boolean functions in 0-1 linear programming, Methods of Operations Research (1971) 154-184.
26. H. Greenberg and W. Pierskalla, Surrogate mathematical programs, Operations Research 18 (1970) 924-939.
27. P. Hammer, M. Padberg and U. Peled, Constraint pairing in integer programming, INFOR 13(1) (1975) 68-81.
28. S. Hanafi and A. Fréville, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, EJOR 106 (1998) 659-675.
29. R. Hill and Ch. Reilly, The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance, Management Science 46(2) (2000) 302-317.
30. A. Hoff, A. Løkketangen and I. Mittet, Genetic algorithms for 0/1 multidimensional knapsack problems, Working Paper, Molde College, Molde, Norway (1996).
31. J.N. Hooker, Logic-based methods for optimization, in: Principles and Practice of Constraint Programming, ed. A. Borning, Lecture Notes in Computer Science, Vol. 874 (1994) pp. 336-349.
32. J.N. Hooker and N.R. Natraj, Solving 0-1 optimization problems with k-tree relaxation (1999), in preparation.
33. J.N. Hooker and M.A. Osono, Mixed logical/linear programming, Discrete Applied Mathematics 96-97 (1999) 395-442.
34. J.N. Hooker, H. Yan, I. Grossmann and R. Raman, Logic cuts for processing networks with fixed charges, Computers and Operations Research 21 (1994) 265-279.
35. R.E. Jeroslow and J.K. Lowe, Modeling with integer variables, Mathematical Programming Studies 22 (1984) 167-184.
36. M.H. Karwan and R.L. Rardin, Some relationships between Lagrangian and surrogate duality in integer programming, Mathematical Programming 17 (1979) 230-334.
37. S. Khuri, T. Back and J. Heitkotter, The zero/one multiple knapsack problem and genetic algorithms, in: Proceedings of the 1994 ACM Symposium on Applied Computing (SAC'94) (ACM Press, 1994) pp. 188-193.
38. G. Kochenberger, G. McCarl and F. Wymann, A heuristic for general integer programming, Decision Sciences 5 (1974) 36-44.
39. M. Laguna, J.P. Kelly, J.L. Gonzalez Velarde and F. Glover, Tabu search for the multilevel generalized assignment problem, European Journal of Operational Research 82 (1995) 176-189.
40. A. Løkketangen and F. Glover, Probabilistic move selection in tabu search for zero-one mixed integer programming problems, in: Meta-Heuristics: Theory and Applications, eds. I.H. Osman and J.P. Kelly (1996) pp. 467-487.
41. A. Løkketangen, K. Jörnsten and S. Storøy, Tabu search within a pivot and complement framework, International Transactions of Operations Research 1 (1994) 305-316.
42. R. Loulou and E. Michaelides, New greedy-like heuristics for the multidimensional 0-1 knapsack problem, Operations Research 27 (1979) 1101-1114.
43. S. Martello, D. Pisinger and P. Toth, New trends in exact algorithms for the 0-1 knapsack problem, European Journal of Operational Research 123(2) (1999) 325-336.
44. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations (Wiley, New York, 1990).
45. M.A. Osorio and M. Laguna, Logic cuts for the multilevel generalized assignment problem (2002), to appear in European Journal of Operational Research.
46. M.A. Osorio and R. Mújica, Logic cuts generation in a branch and cut framework for location problems, Investigación Operativa 8(1-3) (1999) 155-166.
47. H. Pirkul, A heuristic solution procedure for the multiconstraint zero-one knapsack problem, Naval Research Logistics 34 (1987) 161-172.
48. D. Pisinger, Contributed research articles: a minimal algorithm for the bounded knapsack problem, ORSA Journal on Computing 12(1) (2000) 75-84.
49. Ch. Reilly, Input models for synthetic optimization problems, in: Proceedings of the 1999 Winter Simulation Conference (1999) pp. 116-121.
50. K.E. Schilling, The growth of m-constraint random knapsacks, European Journal of Operations Research 46 (1990) 109-112.
51. S. Senju and Y. Toyoda, An approach to linear programming with 0-1 variables, Management Science 15 (1968) 196-207.
52. W. Shih, A branch and bound method for the multiconstraint zero-one knapsack problem, Journal of Operation Research Society of Japan 30 (1979) 369-378.
53. A.L. Soyster, B. Lev and W. Slivka, Zero-one programming with many variables and few constraints, European Journal of Operational Research 2 (1978) 195-201.
54. K. Szkatula, The growth of multi-constraint random knapsacks with various right-hand sides of the constraints, European Journal of Operational Research 73 (1994) 199-204.
55. K. Szkatula, The growth of multi-constraint random knapsacks with large right-hand sides of the constraints, Operations Research Letters 21 (1997) 25-30.
56. J. Thiel and S. Voss, Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms, INFOR 32 (1994) 226-242.
57. H.M. Weingartner and D.N. Ness, Methods for the solution of the multidimensional 0/1 knapsack problem, Operations Research 15 (1967) 83-103.
58. J.M. Wilson, Generating cuts in integer programming with families of specially ordered sets, European Journal of Operational Research 46 (1990) 101-108.