Pages that link to "Item:Q1413922"
From MaRDI portal
The following pages link to A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. (Q1413922):
Displayed 10 items.
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- Exact algorithm for generating two-segment cutting patterns of punched strips (Q837733) (← links)
- Two-stage general block patterns for the two-dimensional cutting problem (Q878556) (← links)
- T-shape homogeneous block patterns for the two-dimensional cutting problem (Q933804) (← links)
- A recursive algorithm for constrained two-dimensional cutting problems (Q1029631) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- Simple block patterns for the two-dimensional cutting problem (Q2473240) (← links)
- Sequential heuristic for the two-dimensional bin-packing problem (Q2629597) (← links)
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574) (← links)