Efficient application of nonserial dynamic programming in combinatorial optimization (Q1111950)
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: Efficient application of nonserial dynamic programming in combinatorial optimization |
scientific article; zbMATH DE number 4076995
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient application of nonserial dynamic programming in combinatorial optimization |
scientific article; zbMATH DE number 4076995 |
Statements
Efficient application of nonserial dynamic programming in combinatorial optimization (English)
0 references
1988
0 references
This paper presents sufficient conditions for polynomial convergence of non-serial dynamic programming. A corollary yields polynomial algorithms for solving some well-known optimization problems on new classes of graphs.
0 references
sufficient conditions
0 references
polynomial convergence
0 references
non-serial dynamic programming
0 references
polynomial algorithms
0 references
