Pages that link to "Item:Q2514873"
From MaRDI portal
The following pages link to Upper and lower bounding procedures for the multiple knapsack assignment problem (Q2514873):
Displaying 10 items.
- Tug scheduling for hinterland barge transport: a branch-and-price approach (Q1681331) (← links)
- Emergency relocation of items using single trips: special cases of the multiple knapsack assignment problem (Q1751729) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
- The assignment and loading transportation problem (Q2029276) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A new upper bound for the multiple knapsack problem (Q2668625) (← links)
- Optimal selection of touristic packages based on user preferences during sports mega-events (Q2672108) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
- A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)
