Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems

References

• Adams W. P. , Sherali H. D. Mixed-integer bilinear programming problems. (1985) . Clemson University Technical report URI 475, Clemson, SC Google Scholar
• Adams W. P. , Sherali H. D. A tight linearization and an algorithm for zero-one quadratic programming problems. Management Sci. (1986) 32 1274 1290 Link, Google Scholar
• Adams W. P. , Sherali H. D. Linearization strategies for a class of zero-one mixed integer programming problems. Opns. Res. (1990) 38 217 226 Link, Google Scholar
• Adams W. P. , Sherali H. D. Mixed-integer bilinear programming problems. Math. Prog. (1993) 59 279 305 Crossref, Google Scholar
• Balas E. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Alg. Disc. Meth. (1983) 6 466 486 Crossref, Google Scholar
• Balas E. , Ceria S. , Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Prog. (1993) 58 295 324 Crossref, Google Scholar
• Balas E. , Ceria S. , Cornuéjols G. , Pataki G. Polyhedral methods for the maximum clique problem. (1994) . Research report, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA Google Scholar
• Balas E. , Zemel E. Facets of the knapsack polytope from minimal covers. SIAM J. Appl. Math. (1978) 34 119 148 Crossref, Google Scholar
• Crowder H. , Johnson E. , Padberg M. Solving large-scale zero-one linear programming problems. Opns. Res. (1983) 31 803 834 Link, Google Scholar
• Lovász L. , Schrijver A. Cones of matrices and set functions, and 0-1 optimization. SIAM J. Opt. (1991) 1 166 190 Crossref, Google Scholar
• Nemhauser G. L. , Wolsey L. A. Integer and Combinatorial Optimization (1988) (John Wiley and Sons, New York) Crossref, Google Scholar
• Sherali H. D. , Adams W. P. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Disc. Math. (1990) 3 411 430 Crossref, Google Scholar
• Sherali H. D. , Adams W. P. A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Disc. Appl. Math. (1994a) 52 83 106 . Manuscript 1989 Crossref, Google Scholar
• Sherali H. D. , Adams W. P. A reformulationlinearization technique (RLT) for solving discrete and continuous nonconvex programming problems. Mathematics Today (1994b) 61 78 . XII-A, special issue on Recent Advances in Mathematical Programming Google Scholar
• Sherali H. D. , Adams W. P. A Reformulation-Linearization Technique (RLT) for Solving Discrete and Continuous Nonconvex Problems (1997) (Kluwer Academic Publishers, Boston, MA) . Series on Nonconvex Optimization and Its Applications Google Scholar
• Sherali H. D. , Driscoll P. J. On tightening the relaxations of Miller-Tucker-Zemlin formulations for the asymmetric traveling salesman problem. (1996) . Research report, Department of Mathematical Sciences, United States Military Academy, West Point, NY Google Scholar
• Sherali H. D. , Lee Y. Tighter representations for set partitioning problems via a reformulation-linearization technique. Disc. Appl. Math. (1996) 68 153 167 . Manuscript, 1992 Crossref, Google Scholar
• Sherali H. D. , Lee Y. Sequential and simultaneous liftings of minimal cover inequalities for generalized upper bound constrained knapsack polytopes. SIAM J. Disc. Math. (1995) 8 1 133 153 Crossref, Google Scholar
• Sherali H. D. , Tuncbilek C. H. A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Global Optim. (1992) 2 101 112 Crossref, Google Scholar
• Sherali H. D. , Tuncbilek C. H. A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Global Optim. (1995) 7 1 31 Crossref, Google Scholar
• Wolsey L. A. Valid inequalities for 0-1 knapsacks and MIP with generalized upper bound constraints. Disc. Appl. Math. (1990) 29 251 261 Crossref, Google Scholar