Pages that link to "Item:Q1569936"
From MaRDI portal
The following pages link to Approximation algorithms for knapsack problems with cardinality constraints (Q1569936):
Displayed 13 items.
- Tight bounds for online class-constrained packing (Q596145) (← links)
- Approximation schemes for knapsack problems with shelf divisions (Q818116) (← links)
- \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities (Q954026) (← links)
- Modified subset sum heuristics for bin packing (Q1044695) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- On the complexity of working set selection (Q2381582) (← links)
- Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
- An efficient algorithm for the collapsing knapsack problem (Q2489216) (← links)
- Hybrid rounding techniques for knapsack problems (Q2489957) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- Integer knapsack problems with set-up weights (Q2642635) (← links)