A recursive procedure to generate all cuts for 0-1 mixed integer programs
From MaRDI portal
Publication:1813832
DOI10.1007/BF01585752zbMATH Open0735.90049MaRDI QIDQ1813832FDOQ1813832
Authors: Laurence A. Wolsey, G. L. Nemhauser 
Publication date: 25 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
valid inequalitiessplit cutsdisjunctive cutssuperadditive inequalitiesdisjunctive methodMIR cutssuperadditive method
Cites Work
- Title not available (Why is that?)
- Cutting-plane theory: Algebraic methods
- Title not available (Why is that?)
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- On Cutting Planes
- Two Rules for Deducing Valid Inequalities for 0-1 Problems
Cited In (84)
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables
- On the facet defining inequalities of the mixed-integer bilinear covering set
- On generalized surrogate duality in mixed-integer nonlinear programming
- Some cut-generating functions for second-order conic sets
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming
- A simulation-based decomposition approach for two-stage staffing optimization in call centers under arrival rate uncertainty
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
- MIPping closures: An instant survey
- Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
- Another pedagogy for mixed-integer Gomory
- Intersection Disjunctions for Reverse Convex Sets
- The aggregation closure is polyhedral for packing and covering integer programs
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
- A note on the continuous mixing set
- Testing cut generators for mixed-integer linear programming
- Title not available (Why is that?)
- The rank of (mixed-) integer polyhedra
- Lifting the knapsack cover inequalities for the knapsack polytope
- Hooked on IP
- Computational aspects of infeasibility analysis in mixed integer programming
- Lifting for the integer knapsack cover polyhedron
- Strengthened clique-family inequalities for the stable set polytope
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Lattice Reformulation Cuts
- A note on the MIR closure
- Valid inequalities for mixed integer linear programs
- Cutting planes for integer programs with general integer variables
- Integer-programming software systems
- A note on the split rank of intersection cuts
- The mixing-MIR set with divisible capacities
- Theoretical challenges towards cutting-plane selection
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- How tight is the corner relaxation? Insights gained from the stable set problem
- On the Practical Strength of Two-Row Tableau Cuts
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- Characterization of the split closure via geometric lifting
- The strength of multi-row models
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
- Elementary closures for integer programs.
- UMTS radio network evaluation and optimization beyond snapshots
- On the relative strength of split, triangle and quadrilateral cuts
- On the complexity of cutting-plane proofs using split cuts
- Cover and pack inequalities for (mixed) integer programming
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Conic mixed-integer rounding cuts
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- Mingling: mixed-integer rounding with bounds
- Two row mixed-integer cuts via lifting
- On the exact separation of mixed integer knapsack cuts
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Revenue models and policies for the car rental industry
- A note on the MIR closure and basic relaxations of polyhedra
- 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
- Cutting planes in integer and mixed integer programming
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- The cutting plane method is polynomial for perfect matchings
- Split closure and intersection cuts
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- MIR closures of polyhedral sets
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- On the relative strength of different generalizations of split cuts
- Sequential pairing of mixed integer inequalities
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Intersection cuts for single row corner relaxations
- On pathological disjunctions and redundant disjunctive conic cuts
- On optimizing over lift-and-project closures
- On cut-based inequalities for capacitated network design polyhedra
- Chvatal--Gomory--tier cuts for general integer programs
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
- Cutting planes from two-term disjunctions
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
- Three enhancements for optimization-based bound tightening
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
This page was built for publication: A recursive procedure to generate all cuts for 0-1 mixed integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813832)
