A dynamic programming algorithm to find all solutions in a neighborhood of the optimum
- 1 December 1985
- journal article
- research article
- Published by Elsevier in Mathematical Biosciences
- Vol. 77 (1-2) , 179-188
- https://doi.org/10.1016/0025-5564(85)90096-3
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic ProgrammingOperations Research, 1984
- Optimal sequence alignmentsProceedings of the National Academy of Sciences, 1983
- Data Structures and Computer Science Techniques in Operations ResearchOperations Research, 1978
- More on k th shortest pathsCommunications of the ACM, 1975
- A Note on an Algebra for the k Best Routes in a NetworkIMA Journal of Applied Mathematics, 1973
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Solutions of the kth best route through a network — A reviewJournal of Mathematical Analysis and Applications, 1961
- Letter to the Editor—The kth Best Route Through a NetworkOperations Research, 1961
- A Method for the Solution of the N th Best Path ProblemJournal of the ACM, 1959