Pages that link to "Item:Q4629975"
From MaRDI portal
The following pages link to The Simplex Algorithm Is NP-Mighty (Q4629975):
Displaying 11 items.
- Algorithms for flows over time with scheduling costs (Q2118123) (← links)
- Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\) (Q2362245) (← links)
- (Q4553289) (← links)
- Algorithms for Flows over Time with Scheduling Costs (Q5041740) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- (Q5363040) (redirect page) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)
- Lexicographically optimal earliest arrival flows (Q6068531) (← links)
- The Polyhedral Geometry of Pivot Rules and Monotone Paths (Q6075416) (← links)
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls (Q6567266) (← links)
