|
|
Volumn 22, Issue 4, 1997, Pages 769-792
|
|
On the complexity of solving sparse symmetric linear programs specified with approximate data
a
a
NONE
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
MATRIX ALGEBRA;
CONDITION MEASURES;
SPARSE SYMMETRIC LINEAR PROGRAMS;
LINEAR PROGRAMMING;
|
|
EID: 0031273169
PISSN: 0364765X
EISSN: None
Source Type: Journal
DOI: 10.1287/moor.22.4.769 Document Type: Article |
|
Times cited : (11)
|
|
References (7)
|
