The following pages link to (Q2779608):
Displaying 18 items.
- A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
- A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← links)
- Vector bin packing with multiple-choice (Q427903) (← links)
- Heuristics for the general multiple non-linear knapsack problem (Q510935) (← links)
- Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540) (← links)
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
- Cut generation for an integrated employee timetabling and production scheduling problem (Q1037686) (← links)
- Cut generation for an employee timetabling problem (Q1042034) (← links)
- Relaxations and heuristics for the multiple non-linear separable knapsack problem (Q1652581) (← links)
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem (Q1753394) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024) (← links)
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem (Q2890459) (← links)
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core (Q3628453) (← links)
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem (Q3750525) (← links)
- (Q4240871) (← links)
- The multiple-choice multi-period knapsack problem (Q4661132) (← links)
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems (Q5202507) (← links)
