A DYNAMIC-PROGRAMMING ALGORITHM TO FIND ALL SOLUTIONS IN A NEIGHBORHOOD OF THE OPTIMUM

被引：45

作者：

WATERMAN, MS ^{[1
]}

BYERS, TH ^{[1
]}

机构：

[1] DIGITAL RES INC,PACIFIC GROVE,CA 93950

来源：

关键词：

D O I：

10.1016/0025-5564(85)90096-3

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

引用

页码：179 / 188

页数：10

共 23 条

[1]

[Anonymous], 1961, J MATH ANAL APPL

[2] ON KTH BEST POLICIES [J].

BELLMAN, R ;

KALABA, R .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (04) :582-588

BYERS, TH ;

WATERMAN, MS .

[4]

DENARDO E, 1980, DYNAMIC PROGRAMMING

[5]

Dreyfus S., 1976, ART THEORY DYNAMIC P

[6] AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J].

DREYFUS, SE .

[7]

ELMAGHRABY S, 1970, LECTURE NOTES EC MAT, V29

[8]

FAN LT, 1964, DISCRETE MAXIMUM PRI

[9] OPTIMAL SEQUENCE ALIGNMENTS [J].

FITCH, WM ;

SMITH, TF .

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA-BIOLOGICAL SCIENCES, 1983, 80 (05) :1382-1386

[10]

FOX B, 1973, COMM ACM, V18, P279