Local cuts for mixed-integer programming

DOI10.1007/s12532-013-0052-9zbMath1275.90043OpenAlexW2138131169MaRDI QIDQ2392934

William Cook, Vašek Chvátal, Daniel G. Espinoza

Publication date: 5 August 2013

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.2766

zbMATH Keywords

cutting planesseparating hyperplanemapped space

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (6)

Optimal patchings for consecutive ones matrices ⋮ Chance-Constrained Binary Packing Problems ⋮ Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ Target Cuts from Relaxed Decision Diagrams ⋮ The strength of multi-row models

Uses Software

• SCIP
• MIPLIB
• CPLEX
• Benchmarks for Optimization Software
• QSopt_ex
• Concorde
• MIPLIB2003

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lifting, tilting and fractional programming revisited
• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• SCIP: solving constraint integer programs
• Local cuts revisited
• Disjunctive programming: Properties of the convex hull of feasible points
• Geometric algorithms and combinatorial optimization.
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• Branching rules revisited
• Sequence independent lifting in mixed integer programming
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Exact solutions to linear programming problems
• Optimizing over the split closure
• Gomory cuts revisited
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
• K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
• Numerically Safe Gomory Mixed-Integer Cuts
• An Exact Rational Mixed-Integer Programming Solver
• Integer Programming with a Fixed Number of Variables
• Integer Programming and Pricing
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Sequence Independent Lifting for Mixed-Integer Programming
• Solving Large-Scale Zero-One Linear Programming Problems
• Generating Fenchel Cutting Planes for Knapsack Polyhedra
• Fenchel Cutting Planes for Integer Programs
• A Computational Study of Search Strategies for Mixed Integer Programming

This page was built for publication: Local cuts for mixed-integer programming