Pivot selection methods of the Devex LP code
From MaRDI portal
Cites work
Cited in
(67)- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- A general phase-I method in linear programming
- Degeneracy in the presence of roundoff errors
- The simplex method is not always well behaved
- A dual projective simplex method for linear programming
- A practical anti-cycling procedure for linearly constrained optimization
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- Selected bibliography on degeneracy
- Degeneracy graphs: Theory and applications. An updated survey
- Pivot rules for linear programming: A survey on recent theoretical developments
- Resolving degeneracy in quadratic programming
- Encounters with degeneracy: A personal view
- A practical anti-degeneracy row selection technique in network linear programming
- MOPS -- Mathematical optimization system
- Adjacent vertex simplex algorithms: More experimental results on random problems
- Recovering an optimal LP basis from an interior point solution
- Advances in design and implementation of optimization software
- Parallelizing the dual revised simplex method
- Steepest-edge simplex algorithms for linear programming
- Numerical aspects in developing LP softwares, LPAKO and LPABO
- Solving linear programs with multiple right-hand sides: Pricing and ordering schemes
- Empirical column selection method in the simplex method
- A projective simplex algorithm using LU decomposition
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- Implementation of an interior point method with basis preconditioning
- A pathsearch damped Newton method for computing general equilibria
- Parallel distributed-memory simplex for large-scale stochastic LP problems
- A largest-distance pivot rule for the simplex algorithm
- Hyper-sparsity in the revised simplex method and how to exploit it
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- A new local dimming algorithm based on the simplex method
- Improved primal simplex: a more general theoretical framework and an extended experimental analysis
- Primal and dual active-set methods for convex quadratic programming
- A linear programming decomposition focusing on the span of the nondegenerate columns
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Computing in operations research using Julia
- Solving Large Scale Generalized Networks
- On Estimating Optimal Bases for Linear Programs
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- A bump triangular dynamic factorization algorithm for the simplex method
- A degeneracy exploiting LU factorization for the simplex method
- A practicable steepest-edge simplex algorithm
- Heuristische Lösungsverfahren Versuch einer Begriffsklärung
- Experiments in mixed-integer linear programming using pseudo-costs
- On the Bartels—Golub decomposition for linear programming bases
- Testing of a large-scale network optimization program
- On pricing and backward transformation in linear programming
- On a dual method for a specially structured linear programming problem with application to stochastic programming
- LPAKO: A Simplex-based Linear Programming Program
- Solving staircase linear programs by the simplex method, 2: Pricing
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- A survey of the operational use of ILP models
- Linear programing formulations and algorithms for radiotherapy treatment planning
- Primal-dual methods for sustainable harvest scheduling problems
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- Optimal pivot path of the simplex method for linear programming based on reinforcement learning
- A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method
- A global pricing extension of the simplex method
- Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
- Vector processing in simplex and interior methods for linear programming
- Experiments with external pivoting
- An efficient approach to updating simplex multipliers in the simplex algorithm
- Efficient nested pricing in the simplex algorithm
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Towards a practical parallelisation of the simplex method
- Computational study of the GDPO dual phase-1 algorithm
This page was built for publication: Pivot selection methods of the Devex LP code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5677274)
