A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.047 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018212883 / rank | |||
Normal rank | |||
Revision as of 23:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting |
scientific article |
Statements
A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (English)
0 references
23 November 2009
0 references
heuristic
0 references
dynamic programming
0 references
2D cutting
0 references
