Pages that link to "Item:Q5970810"
From MaRDI portal
The following pages link to A faster FPTAS for knapsack problem with cardinality constraint (Q5970810):
Displaying 8 items.
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- A new fully polynomial time approximation scheme for the Knapsack problem (Q1304384) (← links)
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- An FPTAS for the parametric knapsack problem (Q2361499) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5918631) (← links)
- High-speed train timetable optimization based on space-time network model and quantum simulator (Q6176961) (← links)
- An FPTAS for budgeted laminar matroid independent set (Q6556192) (← links)