Pages that link to "Item:Q5646679"
From MaRDI portal
The following pages link to Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions (Q5646679):
Displayed 6 items.
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Coefficient strengthening: a tool for reformulating mixed-integer programs (Q847848) (← links)
- Some aspects of integer programming duality (Q1148793) (← links)
- Applying a modified coefficient reduction method to a dynamic production scheduling model (Q1197923) (← links)
- Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
- Coefficient reduction for inequalities in 0–1 variables (Q4044367) (← links)