Pages that link to "Item:Q1088911"
From MaRDI portal
The following pages link to Strongly polynomial algorithm for a class of combinatorial LCPs (Q1088911):
Displayed 5 items.
- Some LCPs solvable in strongly polynomial time with Lemke's algorithm (Q344960) (← links)
- A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
- On polynomial solvability of the high multiplicity total weighted tardiness problem (Q1208472) (← links)
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
- Two counterexamples on the polynomial solvability of the linear complementarity problem (Q3809598) (← links)