Pages that link to "Item:Q4175050"
From MaRDI portal
The following pages link to An algorithm for 0-1 multiple-knapsack problems (Q4175050):
Displaying 13 items.
- An ejection chain approach for the quadratic multiple knapsack problem (Q323171) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
- Solution of the zero-one multiple knapsack problem (Q1142701) (← links)
- Heuristic algorithms for the multiple knapsack problem (Q1148788) (← links)
- A bound and bound algorithm for the zero-one multiple knapsack problem (Q1155514) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- Iterated responsive threshold search for the quadratic multiple knapsack problem (Q2341207) (← links)
- Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation (Q3813622) (← links)
- A heuristic routine for solving large loading problems (Q3962774) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
