Back to search

A dynamic programming algorithm to find all solutions in a neighborhood of the optimum

Data up to Jan 2025

Published1985
Citations74
References26

Total Citations Per Year

Abstract

References (26)

A general method applicable to the search for similarities in the amino acid sequence of two proteins

1970 • 11,049 citations

Combinatorial optimization: networks and matroids

2021 • 3,410 citations

An Appraisal of Some Shortest-Path Algorithms

1969 • 999 citations

The Art and Theory of Dynamic Programming

1977 • 498 citations

Dynamic programming: Models and applications

1982 • 423 citations

Comparative biosequence metrics

1981 • 259 citations

Optimal sequence alignments

1983 • 226 citations

A Method for the Solution of the N th Best Path Problem

1959 • 198 citations

General methods of sequence comparison

1984 • 196 citations

General methods of sequence comparison

1984 • 159 citations

Onkth Best Policies

1960 • 106 citations

Dynamic programming: Models and applications

1984 • 101 citations

Iterative methods for determining the k shortest paths in a network

1976 • 96 citations

The Discrete Maximum Principle

1967 • 85 citations

Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming

1984 • 70 citations

Sequence alignments in the neighborhood of the optimum with general application to dynamic programming

1983 • 67 citations

The Discrete Maximum Principle†

1965 • 67 citations

Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming

1984 • 60 citations

Some Network Models in Management Science

1970 • 43 citations

Solutions of the kth best route through a network — A review

1961 • 42 citations

Computational experience with an algorithm for finding the k shortest paths in a network

1974 • 40 citations

Data Structures and Computer Science Techniques in Operations Research

1978 • 39 citations

CalculatingKth Shortest Paths

1973 • 28 citations

A Note on an Algebra for the k Best Routes in a Network

1973 • 25 citations

More on k th shortest paths

1975 • 12 citations

On Elmaghraby's “The Theory of Networks and Management Science”

1971 • 5 citations

Cited By (0)

Loading...
A dynamic programming algorithm to find all solutions in a neighborhood of the optimum (1985) – Mathematical Biosciences | Metascience Observatory Explorer