Pages that link to "Item:Q2467571"
From MaRDI portal
The following pages link to A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571):
Displaying 25 items.
- An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371) (← links)
- 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)
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
- Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540) (← links)
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem (Q840573) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem (Q1753394) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem (Q2242191) (← links)
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074) (← links)
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem (Q2506174) (← links)
- CORAL: an exact algorithm for the multidimensional knapsack problem (Q2815454) (← links)
- A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability (Q2862159) (← links)
- An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365) (← links)
- Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions (Q3557805) (← links)
- (Q3571520) (← links)
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core (Q3628453) (← links)
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem (Q4678202) (← links)
- (Q4900928) (← links)
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem (Q5148190) (← links)
- Algorithmic Applications in Management (Q5710147) (← links)
