Pages that link to "Item:Q2673561"
From MaRDI portal
The following pages link to A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561):
Displaying 6 items.
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818) (← links)
- Approximate algorithms for constrained circular cutting problems (Q1433164) (← links)
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches (Q2184044) (← links)
- (Q4219274) (← links)
- Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting (Q6568431) (← links)
- A skyline-based heuristic for orthogonal packing rectangles in a circle (Q6568481) (← links)