Pages that link to "Item:Q842766"
From MaRDI portal
The following pages link to Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766):
Displaying 7 items.
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (Q1370660) (← links)
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study (Q1433163) (← links)
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems (Q1991111) (← links)
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem (Q4814179) (← links)
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems (Q5322078) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)