Pages that link to "Item:Q439907"
From MaRDI portal
The following pages link to On the number of solutions generated by the dual simplex method (Q439907):
Displaying 6 items.
- A primal-simplex based Tardos' algorithm (Q1785451) (← links)
- A bound for the number of different basic solutions generated by the simplex method (Q1942281) (← links)
- Short simplex paths in lattice polytopes (Q2117352) (← links)
- The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption (Q2829586) (← links)
- An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables (Q2846492) (← links)
- On the Number of Solutions Generated by the Simplex Method for LP (Q2948780) (← links)