Pages that link to "Item:Q1651697"
From MaRDI portal
The following pages link to A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697):
Displaying 6 items.
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. (Q1413922) (← links)
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
- (Q4368559) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting (Q6568431) (← links)