Foundation-penalty cuts for mixed-integer programs.

DOI10.1016/S0167-6377(03)00014-2MaRDI QIDQ1413909zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An optimality cut for mixed integer linear programs
• Classical cuts for mixed-integer programming and branch-and-cut
• Classical cuts for mixed-integer programming and branch-and-cut
• Gomory cuts revisited
• A relax-and-cut framework for Gomory's mixed-integer cuts

Cites work

• scientific article; zbMATH DE number 3156817 (Why is no real title available?)
• scientific article; zbMATH DE number 3523324 (Why is no real title available?)
• scientific article; zbMATH DE number 3559278 (Why is no real title available?)
• A Computational Study of Search Strategies for Mixed Integer Programming
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Disjunctive Programming
• Disjunctive programming: Properties of the convex hull of feasible points
• Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
• Facet of regular 0–1 polytopes
• Facets of the Knapsack Polytope From Minimal Covers
• Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
• Lifted flow cover inequalities for mixed 0-1 integer programs
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• On the facial structure of set packing polyhedra
• Optimization with disjunctive constraints
• Polyhedral annexation in mixed integer and combinatorial programming
• Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes
• Solving Large-Scale Zero-One Linear Programming Problems
• Some polyhedra related to combinatorial problems
• Surrogate Dual Multiplier Search Procedures in Integer Programming

Cited in

(5)

• An optimality cut for mixed integer linear programs
• 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

This page was built for publication: Foundation-penalty cuts for mixed-integer programs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1413909)