Pages that link to "Item:Q297243"

The following pages link to A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243):

Displaying 25 items.

• 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)
• A randomized heuristic repair for the multidimensional knapsack problem (Q828650) (← links)
• A column generation method for the multiple-choice multi-dimensional knapsack problem (Q969718) (← links)
• An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
• An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem (Q1753394) (← links)
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions (Q1861918) (← links)
• The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
• Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← 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)
• Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571) (← links)
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024) (← links)
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem (Q2506174) (← links)
• A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
• The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
• An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365) (← links)
• (Q3571520) (← links)
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem (Q4678202) (← links)
• A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem (Q5148190) (← links)
• Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)
• A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)
• Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets (Q6667807) (← links)