On the O(n3) algorithm for checking the strong robustness of interval fuzzy matrices

被引：29

作者：

Plavka, Jan ^{[1
]}

机构：

[1] Tech Univ, Dept Math & Theoret Informat, Fac Elect Engn & Informat, Kosice 04200, Slovakia

来源：

DISCRETE APPLIED MATHEMATICS | 2012年 / 160卷 / 4-5期

关键词：

Robustness; Fuzzy matrices; SYSTEMS;

D O I：

10.1016/j.dam.2011.11.010

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Strongly robust interval matrices over (max, min)-algebra (fuzzy matrices) are studied and strong robustness properties are proved, similar to those of classical fuzzy matrices. It is shown that a strong robustness of an interval fuzzy matrix is well-defined using the definition of classical strong robustness. Characterization of strong robustness of interval fuzzy matrices is presented and an O(n(3)) algorithm for checking the strong robustness of interval fuzzy matrices is described. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：640 / 647

页数：8

共 50 条

[31] O(n3) noniterative heuristic algorithm for linear programs with error-free implementation
Lakshmikantham, V
Sen, SK
Jain, MK
Ramful, A
APPLIED MATHEMATICS AND COMPUTATION, 2000, 110 (01) : 53 - 81
[32] New azido complexes of tantalum(V).: Synthesis and molecular structure of the dinuclear compounds [Cp*TaCl(N3)(μ-N3)]2(μ-O) and [Cp*Ta(N3)3(μ-N3)]2 (Cp* = pentamethylcyclopentadienyl)
Herberhold, M
Goller, A
Milius, W
ZEITSCHRIFT FUR ANORGANISCHE UND ALLGEMEINE CHEMIE, 2001, 627 (05): : 891 - 895
[33] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest path
Han, Yijie
ALGORITHMICA, 2008, 51 (04) : 428 - 434
[34] An O(n3 log log n/log n) time algorithm for the all-pairs shortest path problem
Takaoka, T
INFORMATION PROCESSING LETTERS, 2005, 96 (05) : 155 - 161
[35] An O(n3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path
Yijie Han
Algorithmica, 2008, 51 : 428 - 434
[36] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest paths
Han, Yijie
ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 411 - 417
[37] Linear programming in O(n3/ln n/L) operations
Anstreicher, KM
SIAM JOURNAL ON OPTIMIZATION, 1999, 9 (04) : 803 - 812
[38] An O(n3) algorithm for sorting signed genomes by reversals, transpositions, transreversals and block-interchanges
Yu, Shuzhi
Hao, Fanchang
Leong, Hon Wai
JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2016, 14 (01)
[39] AN O(N LOG N) ALGORITHM FOR BANDWIDTH OF INTERVAL-GRAPHS
SPRAGUE, AP
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1994, 7 (02) : 213 - 220
[40] AN O(N(3)LOG N) STRONG POLYNOMIAL ALGORITHM FOR AN ISOTONIC REGRESSION KNAPSACK-PROBLEM
BEST, MJ
TAN, RY
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1993, 79 (03) : 463 - 478

← 1 2 3 4 5 →