Pages that link to "Item:Q1814715"
From MaRDI portal
The following pages link to Approximation for multi-knapsack problem (Q1814715):
Displaying 13 items.
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- The complexity of the 0/1 multi-knapsack problem (Q1076516) (← links)
- Approximation algorithms for the multiple knapsack problem with assignment restrictions (Q1583697) (← links)
- A PTAS for the multiple subset sum problem with different knapsack capacities (Q1607031) (← links)
- Approximation for knapsack problems with multiple constraints (Q1964357) (← links)
- Approximation issues of fractional knapsack with penalties: a note (Q2144213) (← links)
- Approximating the product knapsack problem (Q2230782) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- A Fast Approximation Scheme for the Multiple Knapsack Problem (Q2891378) (← links)
- A Note on Approximation Schemes for Multidimensional Knapsack Problems (Q3718485) (← links)
- A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem (Q4558310) (← links)
- Packing groups of items into multiple knapsacks (Q4601880) (← links)
- Packing Groups of Items into Multiple Knapsacks (Q4629965) (← links)