COMPLEXITY OF SOME PARAMETRIC INTEGER AND NETWORK PROGRAMMING-PROBLEMS

被引：52
作者：
CARSTENSEN, PJ
机构：
来源：
MATHEMATICAL PROGRAMMING | 1983年 / 26卷 / 01期
关键词：
D O I：
10.1007/BF02591893
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：64 / 75
页数：12
相关论文
共 8 条
[1]  
GUSFIELD D, 1980, UCBERL M8022 EL RES
[2]  
Klee V., 1972, INEQUALITIES, V3, P159
[3]  
Matthews G, 1897, P LOND MATH SOC, V28, P486
[4]   COMPUTATIONAL-COMPLEXITY OF PARAMETRIC LINEAR-PROGRAMMING [J].
MURTY, KG .
MATHEMATICAL PROGRAMMING, 1980, 19 (02) :213-219
[5]  
Rockafellar R.T., 1970, CONVEX ANAL
[6]  
Rosenberg I. G., 1974, Discrete Mathematics, V10, P325, DOI 10.1016/0012-365X(74)90126-5
[7]   MULTIPROCESSOR SCHEDULING WITH AID OF NETWORK FLOW ALGORITHMS [J].
STONE, HS .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1977, 3 (01) :85-93
[8]  
Zadeh Norman, 1973, MATH PROGRAM, V5, P255, DOI [DOI 10.1007/BF01580132, 10.1007/BF01580132]
1