Pages that link to "Item:Q543396"

The following pages link to On the exact separation of mixed integer knapsack cuts (Q543396):

Displaying 17 items.

• An implementation of exact knapsack separation (Q330511) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• Intersection cuts for single row corner relaxations (Q1621696) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Tolerance analysis for 0-1 knapsack problems (Q1751719) (← links)
• Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
• Multi-cover inequalities for totally-ordered multiple knapsack sets (Q2061876) (← links)
• The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
• On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
• The strength of multi-row aggregation cuts for sign-pattern integer programs (Q2294249) (← links)
• The strength of multi-row models (Q2516350) (← links)
• Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
• Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable (Q2815436) (← links)
• Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153) (← links)
• Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)