Pages that link to "Item:Q632680"

The following pages link to A heuristic approach for packing identical rectangles in convex regions (Q632680):

Displaying 7 items.

• Numerical optimization method for packing regular convex polygons (Q519665) (← links)
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
• Symmetry-breaking constraints for packing identical rectangles within polyhedra (Q1940443) (← links)
• Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
• Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches (Q2184044) (← links)
• A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
• Packing Problems in Space Solved by CPLEX: An Experimental Analysis (Q3133910) (← links)