Pages that link to "Item:Q4553880"

The following pages link to A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880):

Displaying 10 items.

• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case (Q1429289) (← links)
• The two-dimensional finite bin packing problem. II: New lower and upper bounds (Q1432017) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• A new lower bound for the non-oriented two-dimensional bin-packing problem (Q2467479) (← links)
• A computational study of lower bounds for the two dimensional bin packing problem (Q2861507) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• A fast implementation for the 2D/3D box placement problem (Q5963685) (← links)
• Lower and upper bounding procedures for the bin packing problem with concave loading cost (Q6069214) (← links)