Pages that link to "Item:Q1593538"
From MaRDI portal
The following pages link to A comparative numerical analysis for the guillotine two-dimensional cutting problem (Q1593538):
Displayed 6 items.
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574) (← links)
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces (Q3401326) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)