Skip to main content
Log in

On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We present a framework for automatic tightening of general 0-1 programs. A givenconstraint is tightened by using its own structure as well as information from the other constraints.Our approach exploits special structures that are frequently encountered in practicalproblems, namely knapsack constraints, cliques, covers, variable covers and variable upperbounds. We consider 0-1 knapsack and subset-sum problems with clique and cover inducedconstraints. The tightening (reduction and increasing) of constraint coefficients benefits fromimplication results due to probing analysis. Some computational experience is reported onwell-known real-life problems as well as on a new set of large-scale problems from theinvestment planning sector.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A.L. Brearley, G. Mitra and H.P. Williams, Analysis of mathematical programming problems prior to applying the simplex algorithm, Mathematical Programming 8(1975)54–83.

    Article  Google Scholar 

  2. E. Balas, Facets of the knapsack polytope, Mathematical Programming 8(1975) 146–164.

    Article  Google Scholar 

  3. E. Balas and E. Zemel, Facets of the knapsack polytope from minimal covers, SIAM J. of Applied Mathematics 39(1978)119–148.

    Article  Google Scholar 

  4. E.D. Chajakis and M. Guignard, Exact algorithms, upper bounds and heuristics for the setup knapsack problem, Information Systems and Operations Research (INFOR) 32(1994)124–142.

    Google Scholar 

  5. H. Crowder, E.L. Johnson and M.W. Padberg, Solving large-scale zero-one linear programming problems, Operations Research 31(1983)803–834.

    Google Scholar 

  6. B.L. Dietrich and L.F. Escudero, Coefficient reduction for knapsack constraints in 0-1 programs with VUBs, Operations Research Letters 9(1990)9–14.

    Article  Google Scholar 

  7. B.L. Dietrich and L.F. Escudero, On tightening cover induced inequalities, European J. of Operational Research 60(1992)335–343.

    Article  Google Scholar 

  8. B.L. Dietrich, L.F. Escudero, A. Garín and G. Pérez, O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates, TOP Trabajos de Investigación Operativa 1(1993)139–160.

    Google Scholar 

  9. B.L. Dietrich, L.F. Escudero and F. Chance, Efficient reformulation for 0-1 programs. Methods and Computational results, Discrete Applied Mathematics 42(1993)144–176.

    Article  Google Scholar 

  10. L.F. Escudero, S3 sets. An extension of the Beale –Tomlin special ordered sets, Mathematical Programming 42(1988)113–123.

    Article  Google Scholar 

  11. L.F. Escudero, A. Garín and G. Pérez, On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs, TOP Trabajos de Investigación Operativa 4(1996)87–98.

    Google Scholar 

  12. L.F. Escudero, S. Martello and P. Toth, A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems, in: Integer Programming and Combinatorial Optimization, eds. E. Balas and J. Clausen, Springer, Berlin, 1995, pp. 110–123.

    Google Scholar 

  13. L.F. Escudero and S. Muñoz, On characterizing tighter formulations for 0-1 programs, European J. of Operational Research (1998), to appear.

  14. Z. Gu, G.L. Nemhauser and M.W.P. Savelsbergh, Sequence independent lifting of cover inequalities, in: Integer Programming and Combinatorial Optimization, eds. E. Balas and J. Clausen, Springer, Berlin, 1995, pp. 452–461.

    Google Scholar 

  15. M. Guignard and K. Spielberg, Logical reduction methods in zero-one programming (minimal preferred variables), Operations Research 29(1981)49–74.

    Google Scholar 

  16. IBM, MPSX, Mathematical Programming System Extendedy370, Reference Manual, SH19-6553, 1988.

  17. IBM, OSL, Optimization Subroutine Library, Guide and Reference, SC23-0519, 1990.

  18. E.L. Johnson, M.M. Kostreva and U.H. Suhl, Solving 0-1 integer programming problems arising form large-scale planning models, Operations Research 35(1985)803 –819.

    Google Scholar 

  19. K.L. Hoffman and M.W. Padberg, Improving LP-representations of zero-one linear programs for branch-and-cut, SIAM J. on Computing 3(1991)121–128.

    Google Scholar 

  20. S. Martello and P. Toth, A mixture of dynamic programming and branch-and-bound for the subset-sum problem, Management Science 30(1984)765–771.

    Google Scholar 

  21. S. Martello and P. Toth, A new algorithm for the 0-1 knapsack problem, Management Science 34(1988)633–644.

    Google Scholar 

  22. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, Chichester, 1990.

    Google Scholar 

  23. S. Martello and P. Toth, Exact and approximate algorithms for the two-constraint zero-one knapsack problem, presented at EURO XIV, Jerusalem, July 1995.

  24. G.L. Nemhauser and L.A. Wolsey, Integer Programming and Combinatorial Optimization, Wiley, New York, 1988.

    Google Scholar 

  25. G.L. Nemhauser and L.A. Wolsey, Integer programming, in: Optimization, eds. G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd, North-Holland, Amsterdam, 1989, pp. 447–527.

    Google Scholar 

  26. G.L. Nemhauser, M.W.P. Savelsbergh and G.C. Sigismondi, MINTO, a mixed integer optimizer, Operations Research Letters 15(1994)47–58.

    Article  Google Scholar 

  27. G.L. Nemhauser and P.H. Vance, Lifted cover facets of the 0-1 knapsack polytope with GUB constraints, Operations Research Letters 16(1994)255–263.

    Article  Google Scholar 

  28. M.W. Padberg, A note on zero-one programming, Technical Report, New York University, 1973. See also Operations Research 23(1975)833–837.

  29. U.H. Suhl, Solving large-scale mixed-integer programs with charge variables, Mathematical Programming 32(1985)165–182.

    Article  Google Scholar 

  30. M.W.P. Savelsbergh, Preprocessing and probing techniques for mixed integer programming problems, ORSA J. on Computing 6(1994)445–454.

    Google Scholar 

  31. T. Van Roy and L.A. Wolsey, Solving mixed integer programming problems using automatic reformulation, Operations Research 35(1987)45–57.

    Article  Google Scholar 

  32. H.P. Williams, Model Building in Mathematical Programming, Wiley, New York, 1974.

    Google Scholar 

  33. L.A. Wolsey, Tight formulations for mixed integer programming. A survey, Mathematical Programming 45(1989)173–191.

    Article  Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Escudero, L.F., Martello, S. & Toth, P. On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems. Annals of Operations Research 81, 379–404 (1998). https://doi.org/10.1023/A:1018973511339

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018973511339

Keywords

Navigation