Valid inequalities for mixed integer linear programs
From MaRDI portal
Publication:995784
DOI10.1007/S10107-006-0086-0zbMATH Open1278.90266OpenAlexW2152088446MaRDI QIDQ995784FDOQ995784
Authors: Gérard Cornuéjols 
Publication date: 10 September 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0086-0
Recommendations
PolyhedraElementary closureGomory cutLift-and-projectMixed integer linear programMixed integer roundingSplit cutUnion of polyhedra
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lectures on Polytopes
- Title not available (Why is that?)
- Strengthening cuts for mixed integer programs
- Factoring polynomials with rational coefficients
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Some polyhedra related to combinatorial problems
- Gomory cuts revisited
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Title not available (Why is that?)
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Title not available (Why is that?)
- Some continuous functions related to corner polyhedra
- Disjunctive programming: Properties of the convex hull of feasible points
- Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Intermediate integer programming representations using value disjunctions
- Mixing mixed-integer inequalities
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Title not available (Why is that?)
- When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
- Split closure and intersection cuts
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Optimizing over the split closure
- Edmonds polytopes and a hierarchy of combinatorial problems
- Chvátal closures for mixed integer programming problems
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- On the membership problem for the elementary closure of a polyhedron
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- On Cutting Planes
- Strong formulations of robust mixed 0-1 programming
- On the separation of split cuts and related inequalities
- On cutting-plane proofs in combinatorial optimization
- A connection between cutting plane theory and the geometry of numbers
- On the matrix-cut rank of polyhedra.
- Subset Algebra Lift Operators for 0-1 Integer Programming
- On the Value of Binary Expansions for General Mixed-Integer Linear Programs
- On the rank of mixed 0,1 polyhedra.
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Elementary closures for integer programs.
- The Continuous Mixing Polyhedron
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Compact formulations as a union of polyhedra
- A note on the MIR closure
- Optimizing over the First Chvàtal Closure
- Cutting planes from a mixed integer Farkas lemma.
Cited In (56)
- A bidirectional evolutionary structural optimization algorithm for mass minimization with multiple structural constraints
- Title not available (Why is that?)
- On minimal valid inequalities for mixed integer conic programs
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- On the polyhedral lift-and-project methods and the fractional stable set polytope
- On the facet defining inequalities of the mixed-integer bilinear covering set
- Improving branch-and-cut performance by random sampling
- Two-step MIR inequalities for mixed integer programs
- Computational aspects of infeasibility analysis in mixed integer programming
- On the membership problem for the \({0, 1/2}\)-closure
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Polyhedral approaches to mixed integer linear programming
- A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
- General cut-generating procedures for the stable set polytope
- Preprocessing and cut generation techniques for multi-objective binary programming
- Compact formulations as a union of polyhedra
- A novel dynamic generalized opposition-based grey wolf optimization algorithm
- Redundant robust topology optimization of truss
- A note on the implications of approximate submodularity in discrete optimization
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Integrality gaps for strengthened linear relaxations of capacitated facility location
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- A class of valid inequalities for multilinear 0-1 optimization problems
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- Characterization of the split closure via geometric lifting
- Strong formulations for mixed integer programs: valid inequalities and extended formulations
- Integer Programming and Combinatorial Optimization
- MIPping closures: An instant survey
- The Gomory-Chvátal closure of a non-rational polytope is a rational polytope
- Discrete dynamical system approaches for Boolean polynomial optimization
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Lattice reformulation cuts
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure
- A note on the selection of Benders' cuts
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Valid inequalities for problems with additive variable upper bounds
- Solving discrete linear bilevel optimization problems using the optimal value reformulation
- Optimizing drinking water distribution system operations
- On the minimum cut separator problem
- Strong lift-and-project cutting planes for the stable set problem
- Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming
- Random half-integral polytopes
- The impact of distribution system characteristics on computational tractability
- On mixing sets arising in chance-constrained programming
- An iterative graph expansion approach for the scheduling and routing of airplanes
- A relax-and-cut framework for Gomory mixed-integer cuts
- MIR closures of polyhedral sets
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
- Bi-objective optimization problems with two decision makers: refining Pareto-optimal front for equilibrium solution
- Continuous cutting plane algorithms in integer programming
- The dynamic bowser routing problem
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Classical cuts for mixed-integer programming and branch-and-cut
Uses Software
This page was built for publication: Valid inequalities for mixed integer linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995784)
