Pages that link to "Item:Q1612007"

The following pages link to Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (Q1612007):

Displaying 19 items.

• Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
• On the extremality of maximal dual feasible functions (Q433834) (← links)
• A survey of dual-feasible and superadditive functions (Q610986) (← links)
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
• Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393) (← links)
• Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
• SCIP: solving constraint integer programs (Q734351) (← links)
• On the extreme inequalities of infinite group problems (Q847827) (← links)
• Mixed-integer cuts from cyclic groups (Q868450) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Equivariant perturbation in Gomory and Johnson's infinite group problem. VI: The curious case of two-sided discontinuous minimal valid functions (Q1756343) (← links)
• A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set (Q1785240) (← links)
• Worst-case analysis of maximal dual feasible functions (Q1926616) (← links)
• Face dimensions of general-purpose cutting planes for mixed-integer linear programs (Q2061900) (← links)
• The structure of the infinite models in integer programming (Q2401145) (← links)
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
• Valid inequalities based on simple mixed-integer sets (Q2583149) (← links)
• Spherical cuts for integer programming problems (Q3499437) (← links)