Pages that link to "Item:Q2496024"
From MaRDI portal
The following pages link to Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024):
Displayed 13 items.
- 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)
- 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)
- Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups (Q6060689) (← links)