MINIMAL REPRESENTATIONS OF SOME CLASSES OF DYNAMIC-PROGRAMMING

被引：4

作者：

IBARAKI, T ^{[1
]}

机构：

[1] KYOTO UNIV,FAC ENGN,DEPT APPL MATH & PHYS,KYOTO,JAPAN

来源：

INFORMATION AND CONTROL | 1975年 / 27卷 / 04期

关键词：

D O I：

10.1016/S0019-9958(75)90151-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：289 / 328

页数：40

共 16 条

[1]

Bellman R., 1957, DYNAMIC PROGRAMMING

[2]

Booth T. L., 1967, SEQUENTIAL MACHINES

[3]

Davis M., 1958, COMPUTABILITY UNSOLV

[4] CONTRACTION MAPPINGS IN THEORY UNDERLYING DYNAMIC PROGRAMMING [J].

DENARDO, EV .

[5] CONCEPT OF STATE IN DISCRETE DYNAMIC PROGRAMMING [J].

ELMAGHRABY, SE .

[6]

Harrison M., 1965, INTRO SWITCHING AUTO

[7]

Hopcroft J.E., 1969, FORMAL LANGUAGES THE

[8] REPRESENTATION THEOREMS FOR EQUIVALENT OPTIMIZATION PROBLEMS [J].

IBARAKI, T .

INFORMATION AND CONTROL, 1972, 21 (05) :397-435

[9] SOLVABLE CLASSES OF DISCRETE DYNAMIC PROGRAMMING [J].

IBARAKI, T .

[10]

Ibaraki T., 1973, SIAM Journal on Computing, V2, P193, DOI 10.1137/0202016