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 20 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)
- Algorithmic analysis of priority-based bin packing (Q831745) (← 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)
- Lower bounds and reduction procedures for the bin packing problem (Q917446) (← links)
- Worst-case analyses, linear programming and the bin-packing problem (Q1290661) (← 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)
- Ranking lower bounds for the bin-packing problem (Q1887861) (← links)
- An improved lower bound for the bin packing problem (Q1917305) (← 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-shaped bin packing: Worst case analysis via simulation (Q2386612) (← links)
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity (Q2404356) (← links)
- Fast lifting procedures for the bin packing problem (Q2581316) (← links)
- Computing the asymptotic worst-case of bin packing lower bounds (Q2643960) (← links)
- Analysis of a Hybrid Algorithm for Packing Unequal Bins (Q3777479) (← links)
- New classes of fast lower bounds for bin packing problems (Q5955558) (← links)
