Pages that link to "Item:Q1569936"
From MaRDI portal
The following pages link to Approximation algorithms for knapsack problems with cardinality constraints (Q1569936):
Displaying 14 items.
- On the Proximity of the Optimal Values of the Multi-dimensional Knapsack Problem with and Without the Cardinality Constraint (Q4965095) (← links)
- (Q4996546) (← links)
- Optimal Genetic Screening for Cystic Fibrosis (Q5031012) (← links)
- (Q5092381) (← links)
- Approximation Algorithms for a Bi-level Knapsack Problem (Q5199165) (← links)
- Bounding the running time of algorithms for scheduling and packing problems (Q5890508) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5918631) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5970810) (← links)
- Randomized strategies for robust combinatorial optimization with approximate separation (Q6182680) (← links)
- Bag-of-tasks scheduling with rejection in large computing systems (Q6542877) (← links)
- Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing (Q6556087) (← links)
- An FPTAS for budgeted laminar matroid independent set (Q6556192) (← links)
- Scheduling with cardinality dependent unavailability periods (Q6565385) (← links)
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack (Q6568952) (← links)
