The log bucking problem: A comparison of dynamic programming versus branch and bound (Q1333552)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The log bucking problem: A comparison of dynamic programming versus branch and bound |
scientific article; zbMATH DE number 639346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The log bucking problem: A comparison of dynamic programming versus branch and bound |
scientific article; zbMATH DE number 639346 |
Statements
The log bucking problem: A comparison of dynamic programming versus branch and bound (English)
0 references
15 September 1994
0 references
forestry
0 references
branch and bound
0 references
dynamic programming
0 references
0.7488209009170532
0 references
0.6904417872428894
0 references
0.6828163266181946
0 references
0.6813762187957764
0 references
0.67728191614151
0 references
