Pages that link to "Item:Q1142701"
From MaRDI portal
The following pages link to Solution of the zero-one multiple knapsack problem (Q1142701):
Displaying 12 items.
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
- Bounds for nested knapsack problems (Q1130040) (← links)
- Heuristic algorithms for the multiple knapsack problem (Q1148788) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- A bound and bound algorithm for the zero-one multiple knapsack problem (Q1155514) (← links)
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem (Q2242328) (← links)
- Placement Optimization in Refugee Resettlement (Q5031637) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
- Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs (Q6078291) (← links)