Worst case behavior of the steepest edge simplex method

Cites work

A practicable steepest-edge simplex algorithm
scientific article; zbMATH DE number 3177183 (Why is no real title available?)
scientific article; zbMATH DE number 3466805 (Why is no real title available?)
scientific article; zbMATH DE number 3626518 (Why is no real title available?)
scientific article; zbMATH DE number 3206575 (Why is no real title available?)
The simplex algorithm with the pivot rule of maximizing criterion improvement

Cited in

(29)

A new family of exponential LP problems
An efficient simplex type algorithm for sparse and dense linear programs.
Fast finite methods for a system of linear inequalities
The ellipsoid method and its implications
A double-pivot simplex algorithm and its upper bounds of the iteration numbers
Steepest-edge rule and its number of simplex iterations for a nondegenerate LP
A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games
On scaling linear programs—some experimental results
The Average number of pivot steps required by the Simplex-Method is polynomial
Constraint satisfaction problems over numeric domains
On the length of monotone paths in polyhedra
A friendly smoothed analysis of the simplex method
Pivot rules for circuit-augmentation algorithms in linear optimization
Complexity of the gravitational method for linear programming
An exponential lower bound for Zadeh's pivot rule
Inapproximability of shortest paths on perfect matching polytopes
Upper and lower bounds on the smoothed complexity of the simplex method
The k-Opt algorithm for the traveling salesman problem has exponential running time for k 5
An unconditional lower bound for the active-set method on the hypercube
Exponential lower bounds for many pivot rules for the simplex method
On the efficiency of algebraic simplex algorithms for solving MDPs
Upper and lower bounds on the smoothed complexity of the simplex method
A unified worst case for classical simplex and policy iteration pivot rules
Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
Inapproximability of shortest paths on perfect matching polytopes
On the number of degenerate simplex pivots
On the number of degenerate simplex pivots
Practical finite pivoting rules for the simplex method
An exponential example for Terlaky's pivoting rule for the criss-cross simplex method

This page was built for publication: Worst case behavior of the steepest edge simplex method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1134626)