Pages that link to "Item:Q2643960"
From MaRDI portal
The following pages link to Computing the asymptotic worst-case of bin packing lower bounds (Q2643960):
Displaying 8 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
- New bin packing fast lower bounds (Q883309) (← links)
- An asymptotic approximation scheme for the concave cost bin packing problem (Q933537) (← links)
- Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← links)
- A generalized bin packing problem for parcel delivery in last-mile logistics (Q1755394) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
