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