Pages that link to "Item:Q1678097"
From MaRDI portal
The following pages link to A faster FPTAS for the unbounded knapsack problem (Q1678097):
Displaying 10 items.
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- A note on a variant of the online open end bin packing problem (Q2661578) (← links)
- (Q2798239) (redirect page) (← links)
- (Q5091235) (← links)
- (Q5240419) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5970810) (← links)
- Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (Q6081604) (← links)
