Pages that link to "Item:Q3753810"
From MaRDI portal
The following pages link to The Efficiency of the Simplex Method: A Survey (Q3753810):
Displaying 32 items.
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Probabilistic analysis of a differential equation for linear programming (Q652446) (← links)
- A universal scaling theory for complexity of analog computation (Q716028) (← links)
- Improving the efficiency of the simplex algorithm based on a geometric explanation of phase 1 (Q840613) (← links)
- Experiments with external pivoting (Q909578) (← links)
- An overview on the simplex algorithm (Q1021548) (← links)
- Analysis of stochastic problem decomposition algorithms in computational grids (Q1026583) (← links)
- An analysis of an available set of linear programming test problems (Q1113798) (← links)
- A barrier method for dynamic Leontief-type linear programs (Q1199511) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- A computational study of redundancy in randomly generated polytopes (Q1207047) (← links)
- Algebraic languages for mathematical programming (Q1261394) (← links)
- The simplex method as a global optimizer: A \(C\)-programming perspective (Q1315444) (← links)
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (Q1316098) (← links)
- Adjacent vertex simplex algorithms: More experimental results on random problems (Q1321806) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria (Q1676496) (← links)
- Computational aspects of linear programming simplex method (Q1852251) (← links)
- A note on the distribution of the number of simplex iterations to optimality (Q2324058) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
- Random matrix theory for the analysis of the performance of an analog computer: a scaling theory (Q2383193) (← links)
- Estimating the probability that a given vector is in the convex hull of a random sample (Q2689428) (← links)
- Ein effektives simplexverfahren mit teiltableauwahl (Q3320121) (← links)
- Scaling and universality of the complexity of analog computation (Q3531580) (← links)
- On the efficiency of algorithms of analysis (Q3721699) (← links)
- (Q4308908) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
- On the variance of the number of pivot steps required by the simplex algorithm (Q4845092) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- A Comparison of the Original and Revised Simplex Methods (Q5378744) (← links)
- Complexity of the gravitational method for linear programming (Q5942223) (← links)
- Mathematical decision-making with linear and convex programming (Q6599241) (← links)
