The following pages link to Raïd Mansi (Q833583):
Displaying 6 items.
- A dynamic programming algorithm for the bilevel Knapsack problem (Q833584) (← links)
- Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound (Q1665694) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- One-level reformulation of the bilevel Knapsack problem using dynamic programming (Q1941532) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
