The following pages link to New bin packing fast lower bounds (Q883309):
Displaying 17 items.
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic (Q323187) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- New lower bounds for certain classes of bin packing algorithms (Q441876) (← 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)
- Improved bounds for harmonic-based bin packing algorithms (Q1182320) (← 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)
- Ranking lower bounds for the bin-packing problem (Q1887861) (← links)
- An improved lower bound for the bin packing problem (Q1917305) (← links)
- A tight lower bound for optimal bin packing (Q1919179) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← 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)
- New Lower Bounds for Certain Classes of Bin Packing Algorithms (Q3075446) (← links)
- New classes of fast lower bounds for bin packing problems (Q5955558) (← links)
