COMPLEXITY OF APPROXIMATE SOLUTION OF COMBINATORIAL PROBLEMS

被引：0

作者：

NIGMATULLIN, RG ^{[1
]}

机构：

[1] VI LENIN STATE UNIV,KAZAN,USSR

来源：

DOKLADY AKADEMII NAUK SSSR | 1975年 / 224卷 / 02期

关键词：

D O I：

暂无

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

引用

页码：289 / 292

页数：4

共 50 条

[41] On the probabilistic complexity of finding an approximate solution for linear programming
Ji, Jun
Potra, Florian A.
JOURNAL OF COMPLEXITY, 2008, 24 (02) : 214 - 227
[42] METHODS FOR SOLUTION OF EXTREMAL PROBLEMS OF COMBINATORIAL TYPE
BURKOV, VN
LOVETSKI.SE
AUTOMATION AND REMOTE CONTROL, 1968, (11) : 1785 - &
[43] AUTOMATIC SOLUTION OF A CERTAIN CLASS OF COMBINATORIAL PROBLEMS
COHEN, J
KATCOFF, J
INFORMATION PROCESSING LETTERS, 1977, 6 (04) : 101 - 104
[44] COMBINATORIAL PROBLEMS IN MULTITARGET TRACKING - A COMPREHENSIVE SOLUTION
NAGARAJAN, V
CHIDAMBARA, MR
SHARMA, RN
IEE PROCEEDINGS-F RADAR AND SIGNAL PROCESSING, 1987, 134 (01) : 113 - 118
[45] Monte Carlo solution of combinatorial optimization problems
S. A. Rashkovskiy
Doklady Mathematics, 2016, 94 : 720 - 724
[46] SOLUTION OF COMBINATORIAL OPTIMIZATION PROBLEMS WITH MINIMAX CRITERION
KRAVTSOV, MK
SHERMAN, AK
CYBERNETICS, 1989, 25 (03): : 371 - 379
[47] RECURSIVE SOLUTION OF A CLASS OF COMBINATORIAL PROBLEMS - AN EXAMPLE
LYNCH, WC
COMMUNICATIONS OF THE ACM, 1965, 8 (10) : 617 - &
[48] A general solution for combinatorial problems by neural networks
Chikamatsu, Y
Ae, T
Yamashita, M
SYSTEMS AND COMPUTERS IN JAPAN, 1996, 27 (01) : 101 - 109
[49] Monte Carlo solution of combinatorial optimization problems
Rashkovskiy, S. A.
DOKLADY MATHEMATICS, 2016, 94 (03) : 720 - 724
[50] On the complexity of solution extension of optimization problems
Casel, Katrin
Fernau, Henning
Ghadikolaei, Mehdi Khosravian
Monnot, Jerome
Sikora, Florian
THEORETICAL COMPUTER SCIENCE, 2022, 904 : 48 - 65

← 1 2 3 4 5 →