Pages that link to "Item:Q1326508"
From MaRDI portal
The following pages link to Reducing the number of variables in integer and linear programming problems (Q1326508):
Displaying 10 items.
- Progress in presolving for mixed integer programming (Q903920) (← links)
- Reducing the number of variables in integer quadratic programming problem (Q967821) (← links)
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← links)
- On the reduction method for integer linear programs. II (Q1085786) (← links)
- A note on reducing the number of variables in integer programming problems (Q1369365) (← links)
- On dominated terms in the general knapsack problem (Q1371953) (← links)
- Unbounded knapsack problem: Dynamic programming revisited (Q1569945) (← links)
- A variable-grouping based genetic algorithm for large-scale integer programming (Q2509223) (← links)
- The Elimination of Integer Variables (Q4018527) (← links)
- A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG (Q6201534) (← links)