Foundation-penalty cuts for mixed-integer programs.

DOI10.1016/S0167-6377(03)00014-2zbMath1041.90032OpenAlexW2084766565MaRDI QIDQ1413909

Fred Glover, Hanif D. Sherali

Publication date: 17 November 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00014-2

zbMATH Keywords

Cutting planesMixed-integer programmingbranch and bound penalties

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Surrogate-RLT cuts for zero-one integer programs, Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization, Chvatal--Gomory--tier cuts for general integer programs, A conditional logic approach for strengthening mixed 0-1 linear programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization with disjunctive constraints
• 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
• Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Some polyhedra related to combinatorial problems
• Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Surrogate Dual Multiplier Search Procedures in Integer Programming
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Solving Large-Scale Zero-One Linear Programming Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Facet of regular 0–1 polytopes
• Polyhedral annexation in mixed integer and combinatorial programming
• Facets of the Knapsack Polytope From Minimal Covers
• Disjunctive Programming
• A Computational Study of Search Strategies for Mixed Integer Programming
• Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
• On the facial structure of set packing polyhedra