Pages that link to "Item:Q2467479"

The following pages link to A new lower bound for the non-oriented two-dimensional bin-packing problem (Q2467479):

Displaying 15 items.

• Constrained order packing: comparison of heuristic approaches for a new bin packing problem (Q300978) (← links)
• A hybrid algorithm for constrained order packing (Q301159) (← links)
• Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts (Q339606) (← links)
• A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
• A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts (Q632697) (← links)
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
• A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248) (← 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)
• A sequential value correction heuristic for a bi-objective two-dimensional bin-packing (Q1742194) (← links)
• A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates (Q1754152) (← links)
• Number of bins and maximum lateness minimization in two-dimensional bin packing (Q2029951) (← links)
• Sequential heuristic for the two-dimensional bin-packing problem (Q2629597) (← links)
• A computational study of lower bounds for the two dimensional bin packing problem (Q2861507) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)