Pages that link to "Item:Q1758871"
From MaRDI portal
The following pages link to A procedure-based heuristic for 0-1 multiple knapsack problems (Q1758871):
Displayed 8 items.
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- Solving knapsack problems on GPU (Q1761942) (← links)
- Complexity indices for the multidimensional knapsack problem (Q2045626) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Upper and lower bounding procedures for the multiple knapsack assignment problem (Q2514873) (← links)
- A new upper bound for the multiple knapsack problem (Q2668625) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)