Reference Type | Journal (article/letter/editorial) |
---|
Title | Complexity of large-update interior point algorithm for P∗(κ) linear complementarity problems |
---|
Journal | Computers & Mathematics with Applications |
---|
Authors | Cho, G.M. | Author |
---|
Kim, M.K. | Author |
Lee, Y.H. | Author |
Year | 2007 (March) | Volume | 53 |
---|
Publisher | Elsevier BV |
---|
DOI | doi:10.1016/j.camwa.2006.12.004Search in ResearchGate |
---|
| Generate Citation Formats |
Mindat Ref. ID | 6572053 | Long-form Identifier | mindat:1:5:6572053:2 |
---|
|
GUID | 0 |
---|
Full Reference | Cho, G.M., Kim, M.K., Lee, Y.H. (2007) Complexity of large-update interior point algorithm for P∗(κ) linear complementarity problems. Computers & Mathematics with Applications, 53. 948-960 doi:10.1016/j.camwa.2006.12.004 |
---|
Plain Text | Cho, G.M., Kim, M.K., Lee, Y.H. (2007) Complexity of large-update interior point algorithm for P∗(κ) linear complementarity problems. Computers & Mathematics with Applications, 53. 948-960 doi:10.1016/j.camwa.2006.12.004 |
---|
In | (n.d.) Computers & Mathematics with Applications Vol. 53. Elsevier BV |
---|
These are possibly similar items as determined by title/reference text matching only.