Pages that link to "Item:Q2390210"

The following pages link to Exhaustive approaches to 2D rectangular perfect packings (Q2390210):

Displaying 16 items.

• A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
• An exact strip packing algorithm based on canonical forms (Q339635) (← links)
• Corner occupying theorem for the two-dimensional integral rectangle packing problem (Q362160) (← links)
• A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
• New filtering for the cumulative constraint in the context of non-overlapping rectangles (Q545536) (← links)
• An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
• On packing squares into a rectangle (Q634254) (← links)
• The multiple container loading cost minimization problem (Q635154) (← links)
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553) (← links)
• A branch and bound algorithm for the strip packing problem (Q1017971) (← links)
• Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
• Bubblesearch: a simple heuristic for improving priority-based greedy algorithms (Q1045924) (← links)
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
• A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint (Q1761795) (← links)
• Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)