Local cuts for mixed-integer programming
DOI10.1007/S12532-013-0052-9zbMATH Open1275.90043OpenAlexW2138131169MaRDI QIDQ2392934FDOQ2392934
Authors: Vašek Chvátal, William Cook, 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
Recommendations
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- The traveling salesman problem. A computational study.
- SCIP: solving constraint integer programs
- A Computational Study of Search Strategies for Mixed Integer Programming
- Geometric algorithms and combinatorial optimization.
- Branching rules revisited
- Sequence independent lifting in mixed integer programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Gomory cuts revisited
- Integer Programming with a Fixed Number of Variables
- Solving Large-Scale Zero-One Linear Programming Problems
- Title not available (Why is that?)
- Disjunctive programming: Properties of the convex hull of feasible points
- Numerically safe Gomory mixed-integer cuts
- Fenchel Cutting Planes for Integer Programs
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Optimizing over the split closure
- \(k\)-cuts: a variation of Gomory mixed integer cuts from the LP tableau
- Sequence Independent Lifting for Mixed-Integer Programming
- An exact rational mixed-integer programming solver
- Integer Programming and Pricing
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Local cuts revisited
- Title not available (Why is that?)
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Title not available (Why is that?)
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- Exact solutions to linear programming problems
- Title not available (Why is that?)
- Lifting, tilting and fractional programming revisited
- Aggregation and Mixed Integer Rounding to Solve MIPs
Cited In (13)
- Local cuts revisited
- Optimal patchings for consecutive ones matrices
- Design and verify: A new scheme for generating cutting-planes
- Tilted inequalities and facets of the set covering polytope: a theoretical analysis
- Adaptive cut selection in mixed-integer linear programming
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- The strength of multi-row models
- 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
- Chance-Constrained Binary Packing Problems
- Generating cutting planes for mixed integer programming problems in a parallel computing environment
Uses Software
This page was built for publication: Local cuts for mixed-integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392934)
