The following pages link to (Q5091235):
Displaying 7 items.
- Approximation schemes for multiperiod binary knapsack problems (Q2117082) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees (Q2168712) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
