DETERMINISTIC PRODUCTION PLANNING - ALGORITHMS AND COMPLEXITY

被引：388

作者：

FLORIAN, M

LENSTRA, JK

RINNOOYKAN, AHG

机构：

[1] MATH CENTRUM,NL-1005 AMSTERDAM,NETHERLANDS

[2] ERASMUS UNIV,ROTTERDAM,NETHERLANDS

来源：

MANAGEMENT SCIENCE | 1980年 / 26卷 / 07期

关键词：

D O I：

10.1287/mnsc.26.7.669

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：669 / 679

页数：11

共 24 条

[1]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[2]

Baker KennethR., 1978, MANAGE SCI, V24, P1710, DOI DOI 10.1287/MNSC.24.16.1710

[3]

Bellman R. E., 1962, APPL DYNAMIC PROGRAM

[4]

Busacker R, 1961, 15 J HOPK U OP RES O

[5]

CHEN K, UNPUBLISHED

[6] SHORTEST-ROUTE METHODS .1. REACHING, PRUNING, AND BUCKETS [J].

DENARDO, EV ;

FOX, BL .

OPERATIONS RESEARCH, 1979, 27 (01) :161-186

[7] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[8] DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS [J].

FLORIAN, M ;

KLEIN, M .

MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 18 (01) :12-20

[9]

Garey M.R., 1979, COMPUTERS INTRACTABI

[10] STRONG NP-COMPLETENESS RESULTS - MOTIVATION, EXAMPLES, AND IMPLICATIONS [J].

GAREY, MR ;

JOHNSON, DS .

JOURNAL OF THE ACM, 1978, 25 (03) :499-508

← 1 2 3 →