Pages that link to "Item:Q3142316"

The following pages link to New Procedures For Preprocessing 0–1 Models With Knapsack-Like Constraints And Conjunctive And/Or Disjunctive Variable Upper Bounds (Q3142316):

Displayed 2 items.

• Lifting cover inequalities for the precedence-constrained knapsack problem (Q674439) ‎ (← links)
• Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds (Q914548) ‎ (← links)