Pages that link to "Item:Q647393"

The following pages link to Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393):

Displaying 13 items.

• A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
• Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
• On the enumerative nature of Gomory's dual cutting plane method (Q607496) (← links)
• A hard integer program made easy by lexicography (Q715074) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
• On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
• Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
• A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
• Local cuts for mixed-integer programming (Q2392934) (← links)
• Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
• Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization (Q4685751) (← links)