A strongly poynomial rounding procedure yielding a maximally complementary solution for P*(k) linear complementarity problems*

A strongly poynomial rounding procedure yielding a maximally complementary solution for P(k) linear complementarity problems

T Illés, J Peng, C Roos, T Terlaky

Research output: Contribution to journal › Article › Scientific › peer-review

Original language	Undefined/Unknown
Pages (from-to)	320-340
Number of pages	21
Journal	SIAM Journal on Optimization
Volume	11
Issue number	2
Publication status	Published - 2000

@article{e61a6e7ff88048099603393c99761ebd,

title = "A strongly poynomial rounding procedure yielding a maximally complementary solution for P*(k) linear complementarity problems*",

keywords = "ZX Int.klas.verslagjaar < 2002",

author = "T Ill{\'e}s and J Peng and C Roos and T Terlaky",

year = "2000",

language = "Undefined/Unknown",

volume = "11",

pages = "320--340",

journal = "SIAM Journal on Optimization",

issn = "1052-6234",

publisher = "Society for Industrial and Applied Mathematics",

number = "2",

}

TY - JOUR

T1 - A strongly poynomial rounding procedure yielding a maximally complementary solution for P*(k) linear complementarity problems*

AU - Illés, T

AU - Peng, J

AU - Roos, C

AU - Terlaky, T

PY - 2000

Y1 - 2000

KW - ZX Int.klas.verslagjaar < 2002

M3 - Article

SN - 1052-6234

VL - 11

SP - 320

EP - 340

JO - SIAM Journal on Optimization

JF - SIAM Journal on Optimization

IS - 2

ER -