DETERMINING ALL OPTIMAL AND NEAR-OPTIMAL SOLUTIONS WHEN SOLVING SHORTEST-PATH PROBLEMS BY DYNAMIC-PROGRAMMING

被引：48

作者：

BYERS, TH ^{[1
]}

WATERMAN, MS ^{[1
]}

机构：

[1] UNIV SO CALIF,LOS ANGELES,CA 90089

来源：

关键词：

D O I：

10.1287/opre.32.6.1381

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：1381 / 1384

页数：4

共 5 条

[1]

[Anonymous], 2012, DYNAMIC PROGRAMMING

[2]

Dreyfus S., 1976, ART THEORY DYNAMIC P

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

DREYFUS, SE .

[4] COMPARATIVE BIOSEQUENCE METRICS [J].

SMITH, TF ;

WATERMAN, MS ;

FITCH, WM .

WATERMAN, MS .

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA-PHYSICAL SCIENCES, 1983, 80 (10) :3123-3124