Pages that link to "Item:Q1860337"

The following pages link to Computational techniques of the simplex method (Q1860337):

Displaying 29 items.

• Circular coloring of graphs via linear programming and tabu search (Q302132) (← links)
• A regularized simplex method (Q302140) (← links)
• Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
• Interior point methods 25 years later (Q439546) (← links)
• Scaling linear optimization problems prior to application of the simplex method (Q453620) (← links)
• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• Efficient optimization of the reward-risk ratio with polyhedral risk measures (Q684143) (← links)
• Efficient nested pricing in the simplex algorithm (Q943787) (← links)
• Computational study of the GDPO dual phase-1 algorithm (Q970138) (← links)
• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
• Feasibility pump 2.0 (Q1043854) (← links)
• Parallel search paths for the simplex algorithm (Q1642812) (← links)
• Computing solutions of the multiclass network equilibrium problem with affine cost functions (Q1730728) (← links)
• Computational aspects of linear programming simplex method (Q1852251) (← links)
• A numerically exact implementation of the simplex method (Q1904700) (← links)
• An advanced macro spreadsheet program for the simplex method (Q1968596) (← links)
• A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
• Parallel distributed-memory simplex for large-scale stochastic LP problems (Q2393649) (← links)
• A largest-distance pivot rule for the simplex algorithm (Q2463487) (← links)
• Solving two-stage stochastic programming problems with level decomposition (Q2468771) (← links)
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
• Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (Q3565464) (← links)
• The Efficiency of the Simplex Method: A Survey (Q3753810) (← links)
• (Q4308908) (← links)
• Permutations in the Factorization of Simplex Bases (Q5139619) (← links)
• Interpolation-Based Model Order Reduction for Polynomial Systems (Q5147986) (← links)
• Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems (Q5436927) (← links)
• Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)
• A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method (Q6660154) (← links)