ON THE COMPLEXITY OF INTEGER PROGRAMMING

被引:330
作者
PAPADIMITRIOU, CH [1 ]
机构
[1] NATL TECH UNIV ATHENS,ATHENS 147,GREECE
关键词
D O I
10.1145/322276.322287
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:765 / 768
页数:4
相关论文
共 8 条
[1]   BOUNDS ON POSITIVE INTEGRAL SOLUTIONS OF LINEAR DIOPHANTINE EQUATIONS [J].
BOROSH, I ;
TREYBIG, LB .
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 55 (02) :299-304
[2]  
COOK SL, 1978, COMMUNICATION
[3]  
Dantzig GB., 1962, LINEAR PROGRAMMING E
[4]  
Garey Michael R., 1979, COMPUTERS INTRACTABI
[5]   STRONG NP-COMPLETENESS RESULTS - MOTIVATION, EXAMPLES, AND IMPLICATIONS [J].
GAREY, MR ;
JOHNSON, DS .
JOURNAL OF THE ACM, 1978, 25 (03) :499-508
[6]  
KANNAN R, 1978, LECT NOTES EC MATH S, V157, P161, DOI DOI 10.1007/978-3-642-95322-4_17
[7]  
Karp R.M., 1972, COMPLEXITY COMPUTER
[8]  
Papadimitriou C.H., 1981, COMBINATORIAL OPTIMI