Pages that link to "Item:Q941553"
From MaRDI portal
The following pages link to A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553):
Displaying 10 items.
- A block-based layer building approach for the 2D guillotine strip packing problem (Q297057) (← links)
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang (Q306089) (← links)
- A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
- An exact method for the 2D guillotine strip packing problem (Q606187) (← links)
- Heuristic algorithm for a cutting stock problem in the steel bridge construction (Q954060) (← links)
- A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation (Q1652199) (← links)
- Minimum tiling of a rectangle by squares (Q1730580) (← links)
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint (Q1761795) (← links)
