Abstract
We present a framework for automatic tightening of general 0–1 programs. A given constraint is tightened by using its own structure as well as information from other constraints. Our approach exploits special structures that are frequently encountered in industry, namely knapsack constraints, cliques, covers, variable covers, variable upper bounds and others. We consider 0–1 knapsack and subset-sum problems with clique and cover induced constraints. The tightening (reduction and increasing) of constraint coefficients benefits from implication results due to probing analysis. Some computational experience is reported.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A.L. Brearly, G. Mitra and H.P. Williams, Analysis of mathematical programming problems prior to applying the Simplex algorithm, Mathematical Programming 8 (1975) 54–83.
E. Balas, Facets of the knapsack polytope, Mathematical Programming 8 (1975) 146–164.
E. Balas and E. Zemel, Facets of the knapsack polytope from minimal covers, SIAM J. of Applied Mathematics 39 (1978) 119–148.
H. Crowder, E.L. Johnson and M.W. Padberg, Solving large-scale zero-one linear programming problems, Operations Research 31 (1983) 803–834.
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.
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.
L.F. Escudero, S3 sets. An extension of the Beale-Tomlin special ordered sets, Mathematical Programming 42 (1988) 113–123.
M. Guignard and K. Spielberg, Logical Reduction Methods in Zero-One Programming (Minimal Preferred Variables), Operations Research 29 (1981) 49–74.
IBM, MPSX, Mathematical Programming System Extended/370, Reference Manual, SH19-6553, 1988.
IBM, OSL, Optimization Subroutine Library, Guide and Reference, SC23-0519, 1990.
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.
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.
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.
S. Martello and P. Toth, A new algorithm for the 0–1 knapsack problem, Management Science 34 (1988) 633–644.
S. Martello and P. Toth, Knapsack problems: Algorithms and computer implementations (J. Wiley, Chichester, 1990).
G.L. Nemhauser, M.W.P. Savelsbergh and G.C. Sigismondi, MINTO, a ixed Integer Optimizer, Operations Research Letters 15 (1994) 47–58.
M.W. Padberg, A note on zero-one programming, Technical Report, New York University, 1973. See also Operations Research 23 (1975) 833–837.
M.W.P. Savelsbergh, Preprocessing and probing techniques for mixed integer programming problems, ORSA J. on Computing 6 (1994) 445–454.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Escudero, L.F., Martello, S., Toth, P. (1995). A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems. In: Balas, E., Clausen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1995. Lecture Notes in Computer Science, vol 920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59408-6_45
Download citation
DOI: https://doi.org/10.1007/3-540-59408-6_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59408-6
Online ISBN: 978-3-540-49245-0
eBook Packages: Springer Book Archive