Pages that link to "Item:Q1148788"
From MaRDI portal
The following pages link to Heuristic algorithms for the multiple knapsack problem (Q1148788):
Displaying 8 items.
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems (Q2569035) (← links)
- An linear programming based lower bound for the simple assembly line balancing problem (Q2569061) (← 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)
- Using fuzzy numbers in knapsack problems (Q5954834) (← links)
- New heuristics for one-dimensional bin-packing (Q5959374) (← links)
- Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs (Q6078291) (← links)