Pages that link to "Item:Q2492703"
From MaRDI portal
The following pages link to A class of polynomially solvable linear complementarity problems (Q2492703):
Displaying 10 items.
- Some LCPs solvable in strongly polynomial time with Lemke's algorithm (Q344960) (← links)
- A polynomially solvable case of optimal linear extension problem of a poset (Q613667) (← links)
- A note on solvability of a class of linear complementarity problems (Q689125) (← links)
- Generalizations of the hidden Minkowski property (Q947672) (← links)
- A new polynomial time method for a linear complementarity problem (Q1207309) (← links)
- Co-NP-completeness of some matrix classification problems (Q1591363) (← links)
- Linear complementarity model predictive control with limited iterations for box-constrained problems (Q2663927) (← links)
- A representation of the solution set of a class of linear complementarity problems (Q2790881) (← links)
- Interior-point algorithm based on general kernel function for monotone linear complementarity problem (Q3572642) (← links)
- (Q5151616) (← links)