Pages that link to "Item:Q1029265"
From MaRDI portal
The following pages link to A successive approximation algorithm for the multiple knapsack problem (Q1029265):
Displaying 9 items.
- An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371) (← links)
- Knapsack with variable weights satisfying linear constraints (Q1683329) (← links)
- Approximation for multi-knapsack problem (Q1814715) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Two-group knapsack game (Q2268867) (← links)
- Worst-case performance of the successive approximation algorithm for four identical knapsacks (Q2450816) (← links)
- A Fast Approximation Scheme for the Multiple Knapsack Problem (Q2891378) (← links)
- A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem (Q4558310) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)