Pages that link to "Item:Q4060734"
From MaRDI portal
The following pages link to Reduction Algorithm for Zero-One Single Knapsack Problems (Q4060734):
Displaying 26 items.
- The zero-one knapsack problem with equality constraint (Q1058453) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- Some computational results on real 0-1 knapsack problems (Q1079123) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- Comment on 'Some computational results on real 0-1 knapsack problems' (Q1089254) (← links)
- An improved direct descent algorithm for binary knapsack problems (Q1115799) (← links)
- A randomized parallel branch-and-bound algorithm (Q1118396) (← links)
- Dynamic programming algorithms for the zero-one knapsack problem (Q1138485) (← links)
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074) (← links)
- The 0-1 knapsack problem with multiple choice constraints (Q1248462) (← links)
- Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem (Q1251184) (← links)
- An algorithm and efficient data structures for the binary knapsack problem (Q1255893) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- Heuristic and reduction algorithms for the knapsack sharing problem (Q1366711) (← links)
- An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271) (← links)
- A pegging approach to the precedence-constrained knapsack problem (Q2371351) (← links)
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
- An exact algorithm for the budget-constrained multiple knapsack problem (Q2885555) (← links)
- A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem (Q3630434) (← links)
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105) (← links)
- Untersuchungen zu speziellen linearen gemischt-ganzzahligen 0-1-optimierungsaufgaben (Q3748069) (← links)
- Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben (Q3804451) (← links)
- An improved enumeration for pure 0-1 programs (Q3978584) (← links)
- A branch and bound algorithm for the generalized assignment problem (Q4066849) (← links)
- An algorithm for the 0/1 Knapsack problem (Q4149230) (← links)
- The Collapsing 0–1 Knapsack Problem (Q4175049) (← links)
