The Efficiency of the Simplex Method: A Survey
From MaRDI portal
(Redirected from Publication:3753810)
Recommendations
Cited in
(41)- An overview on the simplex algorithm
- Analysis of stochastic problem decomposition algorithms in computational grids
- An analysis of an available set of linear programming test problems
- A barrier method for dynamic Leontief-type linear programs
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- A computational study of redundancy in randomly generated polytopes
- Algebraic languages for mathematical programming
- The simplex method as a global optimizer: A C-programming perspective
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- Adjacent vertex simplex algorithms: More experimental results on random problems
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria
- Computational aspects of linear programming simplex method
- A note on the distribution of the number of simplex iterations to optimality
- A characterization theorem and an algorithm for a convex hull problem
- A timing model for the revised simplex method
- Random matrix theory for the analysis of the performance of an analog computer: a scaling theory
- Estimating the probability that a given vector is in the convex hull of a random sample
- Deciding probabilistic automata weak bisimulation: theory and practice
- Ein effektives simplexverfahren mit teiltableauwahl
- Scaling and universality of the complexity of analog computation
- On the efficiency of algorithms of analysis
- scientific article; zbMATH DE number 3987052 (Why is no real title available?)
- Optimization for exaust emission problems by the simplex method
- scientific article; zbMATH DE number 653033 (Why is no real title available?)
- scientific article; zbMATH DE number 1064581 (Why is no real title available?)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- On the variance of the number of pivot steps required by the simplex algorithm
- A friendly smoothed analysis of the simplex method
- A Comparison of the Original and Revised Simplex Methods
- Complexity of the gravitational method for linear programming
- Upper and lower bounds on the smoothed complexity of the simplex method
- Probabilistic analysis of a differential equation for linear programming
- Mathematical decision-making with linear and convex programming
- Exponential lower bounds for many pivot rules for the simplex method
- Upper and lower bounds on the smoothed complexity of the simplex method
- On the number of degenerate simplex pivots
- A universal scaling theory for complexity of analog computation
- On the number of degenerate simplex pivots
- Improving the efficiency of the simplex algorithm based on a geometric explanation of phase 1
- Experiments with external pivoting
This page was built for publication: The Efficiency of the Simplex Method: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753810)
