Optimization of dynamic programming methods when solving extremal combinatorial problems (Q1082266)
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: Optimization of dynamic programming methods when solving extremal combinatorial problems |
scientific article; zbMATH DE number 3972643
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimization of dynamic programming methods when solving extremal combinatorial problems |
scientific article; zbMATH DE number 3972643 |
Statements
Optimization of dynamic programming methods when solving extremal combinatorial problems (English)
0 references
1985
0 references
An approach is described whereby the realization of a dynamic programming method for solving an extremal combinatorial problem can be optimized. The aim of optimization is minimization of either the upper bound of the solution search time or the required working memory volume. The efficiency of the approach is illustrated by examples.
0 references
0.92281145
0 references
0.9119186
0 references
0.9088504
0 references
0.9061774
0 references
0.90491664
0 references
0.90413904
0 references
0.9019693
0 references
