Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs

DOI10.1007/s11590-010-0255-1zbMath1259.90078OpenAlexW2047557344MaRDI QIDQ691415

Hanif D. Sherali, J. Cole Smith

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0255-1

zbMATH Keywords

valid inequalitiesreformulation-linearization techniqueLagrangian dualdisjunctive cutspartial enumeration

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

Surrogate-RLT cuts for zero-one integer programs, A computational study of the cutting plane tree algorithm for general mixed-integer linear programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• On embedding the volume algorithm in a variable target value method.
• Proximity control in bundle methods for convex nondifferentiable minimization
• Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
• Optimization with disjunctive constraints
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Disjunctive programming: Properties of the convex hull of feasible points
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• The volume algorithm: Producing primal solutions with a subgradient method
• Ergodic, primal convergence in dual subgradient schemes for convex programming
• A variable target value method for nondifferentiable optimization
• Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
• Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• On the generation of deep disjunctive cutting planes
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Disjunctive Programming
• A Survey of Lagrangean Techniques for Discrete Optimization
• Validation of subgradient optimization
• Minimization of unsmooth functionals