Pages that link to "Item:Q5418981"
From MaRDI portal
The following pages link to On Simplex Pivoting Rules and Complexity Theory (Q5418981):
Displaying 16 items.
- Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- Practical finite pivoting rules for the simplex method (Q751498) (← links)
- Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples (Q1121785) (← links)
- Green scheduling, flows and matchings (Q2344761) (← links)
- Goldfarb's cube (Q2761104) (← links)
- On the Complexity of Breaking Pseudoentropy (Q2988853) (← links)
- (Q4553289) (← links)
- The Simplex Algorithm Is NP-Mighty (Q4629975) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- The Complexity of Zadeh's Pivot Rule (Q5137866) (← 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)
- Monotone diameter of bisubmodular polyhedra (Q6063788) (← links)
- The Polyhedral Geometry of Pivot Rules and Monotone Paths (Q6075416) (← links)
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls (Q6567266) (← links)