Pages that link to "Item:Q1399594"
From MaRDI portal
The following pages link to Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594):
Displaying 5 items.
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- Models and complexity of multibin packing problems (Q864931) (← links)
- Improved filtering for the bin-packing with cardinality constraint (Q1617384) (← links)
- Lower bounds and algorithms for the minimum cardinality bin covering problem (Q1752204) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
