Strongly polynomial algorithm for a class of combinatorial LCPs

DOI10.1016/0167-6377(87)90036-8zbMath0617.90079OpenAlexW2076336245MaRDI QIDQ1088911

R. Chandrasekaran, Santosh N. Kabadi

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90036-8

zbMATH Keywords

strongly polynomial algorithmlinear complementary problemconvex curve fittingfitting the best convex curve

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks, Some LCPs solvable in strongly polynomial time with Lemke's algorithm, Two counterexamples on the polynomial solvability of the linear complementarity problem, A polynomial algorithm for an integer quadratic non-separable transportation problem, On polynomial solvability of the high multiplicity total weighted tardiness problem

Cites Work

• Factoring polynomials with rational coefficients
• Unnamed Item
• Unnamed Item