Pages that link to "Item:Q342053"

The following pages link to Models and algorithms for packing rectangles into the smallest square (Q342053):

Displaying 8 items.

• Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Descending packing algorithm for irregular graphics based on geometric feature points (Q2214815) (← links)
• A hybrid chaos firefly algorithm for three-dimensional irregular packing problem (Q2338483) (← links)
• 2D Optimal Packing with Population Based Algorithms (Q3297454) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)