Solving multiple knapsack problems by cutting planes

SIAM Journal on Optimization

Volumn 6, Issue 3, 1996, Pages 858-877

  Ferreira, C E ^a   Martin, A ^b   Weismantel, R ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Branch and cut; Cutting planes; Multiple knapsack problem; Separation

Indexed keywords

EID: 0030303866     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623493254455     Document Type: Article

References (18)

1. E. BALAS, Facets of the knapsack polytope, Math. Programming, 8 (1975), pp. 146-164.
2. E. BALAS AND E. ZEMEL, Facets of the knapsack polytope from minimal covers, SIAM J. Appl. Math., 34 (1978), pp. 119-148.
3. E. A. BOYD, A pseudo-polynomial network flow formulation for exact knapsack separation, Networks, 22 (1992), pp. 503-514.
4. Using the CPLEX Callable Library and CPLEX Mixed Integer Library, CPLEX Optimization, 1992.
5. H. CROWDER, E. L. JOHNSON, AND M. W. PADBERG, Solving large-scale zero-one linear programming problems, Oper. Res., 31 (1983), pp. 803-844.
6. C. E. FERREIRA, On Combinatorial Optimization Problems Arising in Computer Systems Design, Ph.D. thesis, Technische Universität Berlin, 1994.
7. C. E. FERREIRA, M. GRÖTSCHEL, S. KIEFL, C. KRISPENZ, A. MARTIN, AND R. WEISMANTEL, Some integer programs arising in the design of main frame computers, ZOR, 38 (1993), pp. 77-100.
8. C. M. FIDUCCIA AND R. M. MATTHEYSES, A linear-time heuristic for improving network partitions, in Proc. 19th DAC, ACM/IEEE, 1982, pp. 175-181.
9. E. S. GOTTLIEB AND M. R. RAO, The generalized assignment problem: Valid inequalities and facets, Math. Programming, 46 (1990), pp. 31-52.
10. _, (1, k)-configuration facets for the generalized assignment problem, Math. Programming, 46 (1990), pp. 53-60.
11. P. L. HAMMER, E. L. JOHNSON, AND U. N. PELED, Facets of regular 0-1 polytopes, Math. Programming, 8 (1975), pp. 179-206.
12. R. M. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, 1972, pp. 85-103.
13. S. MARTELLO AND P. TOTH, Knapsack Problems - Algorithms and Computer Implementations, John Wiley, New York, 1990.
14. M. W. PADBERG, A note on 0-1 programming, Oper. Res., 23 (1975), pp. 833-837.
15. _, (1,k)-configurations and facets for packing problems, Math. Programming 18 (1980), pp. 94-99.
16. L. A. WOLSEY, Faces of linear inequalities in 0-1 variables, Math. Programming, 8 (1975), pp. 165-178.
17. _, Valid inequalities for 0-1 knapsacks and MIPS with generalised upper bound constraints, Discrete Appl. Math., 29 (1990), pp. 251-261.
18. E. ZEMEL, Easily computable facets of the knapsack polytope, Math. Oper. Res., 14 (1989), pp. 760-764.