Sign-Solvable Linear Complementarity Problems

DOI10.1007/978-3-540-72792-7_30MaRDI QIDQ5429282zbMATH OpenOpenAlexFDO

Authors Naonori Kakimura

Publication date 29 November 2007

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72792-7_30

zbMATH Keywords

Linear Complementarity ProblemsCombinatorial Matrix Theory

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Sign-solvable linear complementarity problems
• Solving linear programs from sign patterns
• Signsolvability revisited
• Sparse Linear Complementarity Problems
• A polynomial-time algorithm for a class of linear complementarity problems

Cited in

(3)

• Signsolvability revisited
• Solving linear programs from sign patterns
• Sign-solvable linear complementarity problems

This page was built for publication: Sign-Solvable Linear Complementarity Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429282)