Pages that link to "Item:Q3929533"
From MaRDI portal
The following pages link to On the non-polynomiality of the relaxation method for systems of linear inequalities (Q3929533):
Displaying 4 items.
- Solving the general quadratic programming problem in a finite number of steps (Q382174) (← links)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
