Pages that link to "Item:Q2941508"
From MaRDI portal
The following pages link to The Complexity of the Simplex Method (Q2941508):
Displaying 18 items.
- Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- An overview on the simplex algorithm (Q1021548) (← links)
- The simplex method is not always well behaved (Q1109528) (← links)
- Computational techniques of the simplex method (Q1860337) (← links)
- Automatic verification of concurrent stochastic systems (Q2147696) (← links)
- (Q3321827) (← links)
- (Q3484622) (← links)
- (Q4308908) (← 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)
- On Simplex Pivoting Rules and Complexity Theory (Q5418981) (← 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)
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls (Q6567266) (← links)
