Pages that link to "Item:Q2885555"
From MaRDI portal
The following pages link to An exact algorithm for the budget-constrained multiple knapsack problem (Q2885555):
Displaying 13 items.
- A multi-period renewal equipment problem (Q439598) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- An exact algorithm for the fixed-charge multiple knapsack problem (Q1011207) (← links)
- An exact algorithm for large multiple knapsack problems (Q1124710) (← 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)
- (Q3141337) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem (Q5148190) (← links)
- Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit (Q5223044) (← links)
- Algorithmic Applications in Management (Q5710147) (← links)
- Budgeting with bounded multiple-choice constraints. (Q5928374) (← links)