Pages that link to "Item:Q723482"
From MaRDI portal
The following pages link to Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482):
Displaying 4 items.
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- Monotone diameter of bisubmodular polyhedra (Q6063788) (← links)
- On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs (Q6564294) (← links)