The following pages link to The knapsack problem: A survey (Q4062194):
Displaying 20 items.
- Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540) (← links)
- The zone hopping problem (Q750298) (← links)
- Conjugate duality and the curse of dimensionality (Q811416) (← links)
- Approximate solutions to large scale capacitated facility location problems (Q919754) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- The knapsack problem with generalized upper bounds (Q1122484) (← links)
- The trim-loss and assortment problems: A survey (Q1143942) (← links)
- An extension of a greedy heuristic for the knapsack problem (Q1178644) (← links)
- A complementary greedy heuristic for the knapsack problem (Q1203804) (← links)
- Static main storage packing problems (Q1241277) (← links)
- Heuristic and exact algorithms for the precedence-constrained knapsack problem (Q1586807) (← links)
- An incentive dynamic programming method for the optimization of scholarship assignment (Q1727142) (← links)
- A typology of cutting and packing problems (Q1825761) (← links)
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← links)
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem (Q2242328) (← links)
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
- Fuzzy approach to multilevel knapsack problems (Q2387353) (← links)
- On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)
- Optimization via rejection-free partial neighbor search (Q6085191) (← links)
