Pages that link to "Item:Q1312760"
From MaRDI portal
The following pages link to Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760):
Displaying 50 items.
- A regularized simplex method (Q302140) (← links)
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
- A counterexample to the Hirsch conjecture (Q447933) (← links)
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- The double pivot simplex method (Q684156) (← links)
- The sagitta method for solving linear programs (Q703904) (← links)
- Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm (Q723482) (← links)
- A new version of the improved primal simplex for degenerate linear programs (Q733525) (← links)
- A simpler and tighter redundant Klee-Minty construction (Q941030) (← links)
- Efficient nested pricing in the simplex algorithm (Q943787) (← links)
- Multi-phase dynamic constraint aggregation for set partitioning type problems (Q964175) (← links)
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region (Q1003486) (← links)
- Computing monotone disjoint paths on polytopes (Q1016050) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- The use of the optimal partition in a linear programming solution for postoptimal analysis (Q1342079) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- New variants of finite criss-cross pivot algorithms for linear programming (Q1610181) (← links)
- Customizing the solution process of COIN-OR's linear solvers with python (Q1694292) (← links)
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
- A new efficient primal dual simplex algorithm (Q1868820) (← links)
- Numerical aspects in developing LP softwares, LPAKO and LPABO (Q1872947) (← links)
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming (Q1926882) (← links)
- Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks (Q1945076) (← links)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
- Limit laws for empirical optimal solutions in random linear programs (Q2159558) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920) (← links)
- Stabilized dynamic constraint aggregation for solving set partitioning problems (Q2253353) (← links)
- Steepest-edge rule and its number of simplex iterations for a nondegenerate LP (Q2294288) (← links)
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs (Q2371471) (← links)
- A computationally stable solution algorithm for linear programs (Q2372034) (← links)
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds (Q2476985) (← links)
- An experimental investigation of a primal–dual exterior point simplexalgorithm (Q2868925) (← links)
- The central path visits all the vertices of the Klee–Minty cube (Q3423600) (← links)
- Three nearly scaling-invariant versions of an exterior point algorithm for linear programming (Q3454862) (← links)
- LPAKO: A Simplex-based Linear Programming Program (Q4709753) (← links)
- Dual–primal algorithm for linear optimization (Q4924118) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential (Q5216797) (← links)
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules (Q5413871) (← links)
- Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems (Q5436927) (← links)
- Combined projected gradient algorithm for linear programming (Q5481683) (← links)
- On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method (Q5689973) (← links)
- An interesting characteristic of phase-1 of dual–primal algorithm for linear programming (Q5746711) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- The Polyhedral Geometry of Pivot Rules and Monotone Paths (Q6075416) (← links)
- Revisiting degeneracy, strict feasibility, stability, in linear programming (Q6113350) (← links)
