Pages that link to "Item:Q647399"

The following pages link to A note on the split rank of intersection cuts (Q647399):

Displaying 23 items.

• Characterization of the split closure via geometric lifting (Q319191) (← links)
• Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
• Composite lifting of group inequalities and an application to two-row mixing inequalities (Q429671) (← links)
• Cutting planes from extended LP formulations (Q507316) (← links)
• Cook, Kannan and Schrijver's example revisited (Q955332) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
• Split closure and intersection cuts (Q1774172) (← links)
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
• On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
• Disjunctive programming and relaxations of polyhedra (Q2452382) (← links)
• Optimizing over the split closure (Q2476990) (← links)
• Two-halfspace closure (Q2689824) (← links)
• Split rank of triangle and quadrilateral inequalities (Q2884282) (← links)
• Intersection cuts with infinite Split rank (Q2884303) (← links)
• On the rank of disjunctive cuts (Q2884323) (← links)
• (Q3090134) (← links)
• Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← links)
• (Q4737523) (← links)
• Multirow Intersection Cuts Based on the Infinity Norm (Q5084619) (← links)
• Nonunique Lifting of Integer Variables in Minimal Inequalities (Q5376544) (← links)
• Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
• Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)