Pages that link to "Item:Q2496024"

The following pages link to Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024):

Displaying 20 items.

• Optimizing some constructions with bars: new geometric knapsack problems (Q266044) (← links)
• A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables (Q319990) (← links)
• Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← 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)
• Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
• A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954) (← links)
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions (Q1861918) (← links)
• An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
• Two-dimensional knapsack-block packing problem (Q1984921) (← links)
• Adaptive large neighborhood search for solving the circle bin packing problem (Q2027009) (← 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)
• Vehicle routing problems with alternative paths: an application to on-demand transportation (Q2654320) (← links)
• An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core (Q3628453) (← links)
• (Q4240871) (← links)
• A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX^® (Q5059432) (← links)
• Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups (Q6060689) (← links)