Pages that link to "Item:Q621750"

The following pages link to A heuristic to generate rank-1 GMI cuts (Q621750):

Displaying 10 items.

• Characterization of the split closure via geometric lifting (Q319191) (← links)
• A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
• How tight is the corner relaxation? Insights gained from the stable set problem (Q448970) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• On the relative strength of different generalizations of split cuts (Q1751106) (← links)
• A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
• On optimizing over lift-and-project closures (Q2392660) (← links)
• The strength of multi-row models (Q2516350) (← links)
• Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
• Virtual private network design over the first Chvátal closure (Q5501875) (← links)