Pages that link to "Item:Q2345851"
From MaRDI portal
The following pages link to Packing items into several bins facilitates approximating the separable assignment problem (Q2345851):
Displaying 6 items.
- The transportation problem with conflicts (Q829180) (← links)
- Bin packing using semi-ordinal data (Q2564622) (← links)
- On Packing Splittable Items with Cardinality Constraints (Q3163876) (← links)
- PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM (Q3575375) (← links)
- (Q5075815) (← links)
- Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems (Q6633554) (← links)