Pages that link to "Item:Q2489957"
From MaRDI portal
The following pages link to Hybrid rounding techniques for knapsack problems (Q2489957):
Displayed 6 items.
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- Hybrid rounding techniques for knapsack problems (Q2489957) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times (Q4972675) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5918631) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5970810) (← links)