Local cuts for mixed-integer programming
From MaRDI portal
Publication:2392934
Recommendations
Cites work
- scientific article; zbMATH DE number 1982172 (Why is no real title available?)
- scientific article; zbMATH DE number 1757966 (Why is no real title available?)
- scientific article; zbMATH DE number 2084783 (Why is no real title available?)
- scientific article; zbMATH DE number 2196290 (Why is no real title available?)
- A Computational Study of Search Strategies for Mixed Integer Programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Aggregation and Mixed Integer Rounding to Solve MIPs
- An exact rational mixed-integer programming solver
- Branching rules revisited
- Disjunctive programming: Properties of the convex hull of feasible points
- Exact solutions to linear programming problems
- Fenchel Cutting Planes for Integer Programs
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- Geometric algorithms and combinatorial optimization.
- Gomory cuts revisited
- Integer Programming and Pricing
- Integer Programming with a Fixed Number of Variables
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Lifting, tilting and fractional programming revisited
- Local cuts revisited
- Numerically safe Gomory mixed-integer cuts
- Optimizing over the split closure
- SCIP: solving constraint integer programs
- Sequence Independent Lifting for Mixed-Integer Programming
- Sequence independent lifting in mixed integer programming
- Solving Large-Scale Zero-One Linear Programming Problems
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- The traveling salesman problem. A computational study.
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- \(k\)-cuts: a variation of Gomory mixed integer cuts from the LP tableau
Cited in
(14)- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- Optimal patchings for consecutive ones matrices
- Tilted inequalities and facets of the set covering polytope: a theoretical analysis
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Numerically safe lower bounds for the capacitated vehicle routing problem
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- The strength of multi-row models
- Adaptive cut selection in mixed-integer linear programming
- Local cuts revisited
- Generating cutting planes for mixed integer programming problems in a parallel computing environment
- Continuous cutting plane algorithms in integer programming
- Design and verify: A new scheme for generating cutting-planes
- Target cuts from relaxed decision diagrams
- Chance-Constrained Binary Packing Problems
Describes a project that uses
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)
