Pages that link to "Item:Q2558159"

The following pages link to The simplex algorithm with the pivot rule of maximizing criterion improvement (Q2558159):

Displaying 28 items.

• On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes (Q713305) (← links)
• Practical finite pivoting rules for the simplex method (Q751498) (← links)
• A new family of exponential LP problems (Q1097169) (← links)
• A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps (Q1100853) (← links)
• Worst case behavior of the steepest edge simplex method (Q1134626) (← links)
• On relaxation methods for systems of linear inequalities (Q1159953) (← links)
• Efficient search for rationals (Q1259410) (← links)
• An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
• Fast finite methods for a system of linear inequalities (Q1819897) (← links)
• The ellipsoid method and its implications (Q1835842) (← links)
• A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920) (← links)
• Steepest-edge rule and its number of simplex iterations for a nondegenerate LP (Q2294288) (← links)
• An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
• A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games (Q3009763) (← links)
• Nonadjacent extreme point methods for solving linear programs (Q3673477) (← links)
• On the length of simplex paths: The assignment case (Q3698637) (← links)
• Affirmative action algorithms (Q3725860) (← links)
• On scaling linear programs—some experimental results (Q3835674) (← links)
• The Average number of pivot steps required by the Simplex-Method is polynomial (Q3950310) (← links)
• The Random‐Facet simplex algorithm on combinatorial cubes (Q4537627) (← links)
• Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084) (← links)
• Trivial integer programs unsolvable by branch-and-bound (Q4770206) (← links)
• Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
• On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
• A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
• Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
• The complexity of linear programming (Q5904897) (← links)
• The Polyhedral Geometry of Pivot Rules and Monotone Paths (Q6075416) (← links)