Pages that link to "Item:Q1942281"
From MaRDI portal
The following pages link to A bound for the number of different basic solutions generated by the simplex method (Q1942281):
Displaying 22 items.
- On the number of solutions generated by the dual simplex method (Q439907) (← links)
- Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482) (← links)
- Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming (Q1785275) (← links)
- A primal-simplex based Tardos' algorithm (Q1785451) (← links)
- Short simplex paths in lattice polytopes (Q2117352) (← links)
- A divide-and-conquer algorithm for binary matrix completion (Q2187387) (← links)
- A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920) (← links)
- A scaling algorithm for optimizing arbitrary functions over vertices of polytopes (Q2235141) (← links)
- Klee-Minty's LP and upper bounds for Dantzig's simplex method (Q2275570) (← links)
- Steepest-edge rule and its number of simplex iterations for a nondegenerate LP (Q2294288) (← links)
- Complexity bounds for approximately solving discounted MDPs by value iterations (Q2661516) (← links)
- The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption (Q2829586) (← links)
- An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables (Q2846492) (← links)
- On the Number of Solutions Generated by the Simplex Method for LP (Q2948780) (← links)
- On the reduction of total‐cost and average‐cost MDPs to discounted MDPs (Q3120606) (← links)
- LOWER BOUNDS FOR THE MAXIMUM NUMBER OF SOLUTIONS GENERATED BY THE SIMPLEX METHOD(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) (Q3144758) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- 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)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
- On the number of pivots of Dantzig's simplex methods for linear and convex quadratic programs (Q6564294) (← links)
