Pages that link to "Item:Q1278248"
From MaRDI portal
The following pages link to A recursive exact algorithm for weighted two-dimensional cutting (Q1278248):
Displaying 15 items.
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← 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)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems. (Q1413922) (← links)
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study (Q1433163) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- Simple block patterns for the two-dimensional cutting problem (Q2473240) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- Generating optimal two-section cutting patterns for rectangular blanks (Q2581593) (← links)
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)