Pages that link to "Item:Q3109861"

The following pages link to A Geometric Perspective on Lifting (Q3109861):

Displaying 24 items.

• Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
• Characterization of the split closure via geometric lifting (Q319191) (← links)
• Unique lifting of integer variables in minimal inequalities (Q378135) (← links)
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra (Q715090) (← links)
• Lifting properties of maximal lattice-free polyhedra (Q896280) (← links)
• Intersection cuts for single row corner relaxations (Q1621696) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• On the relative strength of different generalizations of split cuts (Q1751106) (← links)
• A geometric approach to cut-generating functions (Q2349120) (← links)
• Tight bounds on discrete quantitative Helly numbers (Q2360726) (← links)
• An algorithm for the separation of two-row cuts (Q2436649) (← links)
• The strength of multi-row models (Q2516350) (← links)
• Cut-Generating Functions for Integer Variables (Q2833108) (← links)
• Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
• On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
• When Lift-and-Project Cuts Are Different (Q3386803) (← links)
• Operations that Preserve the Covering Property of the Lifting Region (Q3454508) (← links)
• Can Cut-Generating Functions Be Good and Efficient? (Q4634102) (← links)
• Approximation of Minimal Functions by Extreme Functions (Q5376455) (← links)
• Nonunique Lifting of Integer Variables in Minimal Inequalities (Q5376544) (← links)
• Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
• Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
• Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
• Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)