Pages that link to "Item:Q2941508"
From MaRDI portal
The following pages link to The Complexity of the Simplex Method (Q2941508):
Displaying 9 items.
- Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482) (← links)
- Automatic verification of concurrent stochastic systems (Q2147696) (← links)
- (Q4553289) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- On the Complexity of Value Iteration (Q5091264) (← links)
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems (Q5283361) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)
- The Polyhedral Geometry of Pivot Rules and Monotone Paths (Q6075416) (← links)
