Pages that link to "Item:Q1886845"
From MaRDI portal
The following pages link to An analysis of lower bound procedures for the bin packing problem (Q1886845):
Displaying 11 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
- New bin packing fast lower bounds (Q883309) (← links)
- Integrated production and distribution scheduling with a perishable product (Q1751906) (← links)
- Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing (Q2242373) (← links)
- A new lower bound on the price of anarchy of selfish bin packing (Q2274500) (← links)
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity (Q2404356) (← links)
- Computing the asymptotic worst-case of bin packing lower bounds (Q2643960) (← links)
