Pages that link to "Item:Q914548"
From MaRDI portal
The following pages link to Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds (Q914548):
Displaying 13 items.
- Some of my favorite integer programming applications at IBM (Q537591) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds (Q914548) (← links)
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems (Q1067997) (← links)
- On tightening cover induced inequalities (Q1199516) (← links)
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems (Q1265899) (← links)
- Reducing the number of variables in integer and linear programming problems (Q1326508) (← links)
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts (Q1328648) (← links)
- Supernode processing of mixed-integer models (Q1342883) (← links)
- Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
- Covering Linear Programming with Violations (Q2940540) (← links)
- On some extended mixed integer optimization models of the Eisenberg–Noe model in systemic risk management (Q6092540) (← links)
