A dynamic programming algorithm to find all solutions in a neighborhood of the optimum (Q1072453)
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: A dynamic programming algorithm to find all solutions in a neighborhood of the optimum |
scientific article; zbMATH DE number 3941289
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dynamic programming algorithm to find all solutions in a neighborhood of the optimum |
scientific article; zbMATH DE number 3941289 |
Statements
A dynamic programming algorithm to find all solutions in a neighborhood of the optimum (English)
0 references
1985
0 references
A dynamic programming algorithm is described whose aim is to give all paths through an acyclic network whose length is within a certain fixed percentage of that of the shortest path. An example is given and is followed by an extensive discussion of the application of the algorithm to a problem of finding distances between biological sequences. This method is compared with some suggested previously with respect to computational and storage requirements.
0 references
k-th best policies
0 references
near-optimal policies
0 references
matching topological sequences
0 references
0 references
0 references
