The following pages link to On the product knapsack problem (Q1653266):
Displaying 8 items.
- Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- Approximating the product knapsack problem (Q2230782) (← links)
- An optimization algorithm for a penalized knapsack problem (Q2466588) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)