DEVEX
From MaRDI portal
Cited in
(only showing first 100 items - show all)- 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
- A dual approach to primal degeneracy
- Degeneracy in the presence of roundoff errors
- On the solution of highly degenerate linear programmes
- 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
- ASYNPLEX, an asynchronous parallel revised simplex algorithm
- A new steepest edge approximation for the simplex method for linear programming
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- BPMPD
- Practical bilevel optimization. Algorithms and applications
- 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
- LPABO
- LPAKO
- Recovering an optimal LP basis from an interior point solution
- SCICONIC
- PIPS
- The long step rule in the bounded-variable dual simplex method: Numerical experiments
- ASYNPLEX
- Advances in design and implementation of optimization software
- A phase-1 approach for the generalized simplex algorithm
- SoPlex
- Parallelizing the dual revised simplex method
- KORBX
- Customizing the solution process of COIN-OR's linear solvers with python
- PyCOIN
- MINOS
- COPL_QP
- Steepest-edge simplex algorithms for linear programming
- Resolving degeneracy in combinatorial linear programs: Steepest edge, steepest ascent, and parametric ascent
- A basis-defiency-allowing variation of the simplex method for linear programming
- Numerical aspects in developing LP softwares, LPAKO and LPABO
- QPSchur
- The fleet assignment problem: Solving a large scale integer program
- Solving linear programs with multiple right-hand sides: Pricing and ordering schemes
- Empirical column selection method in the simplex method
- A brief history of linear and mixed-integer programming computation
- A projective simplex algorithm using LU decomposition
- LSSOL
- MOPS
- Dsor
- OSL
- Implementation of an interior point method with basis preconditioning
- SIMPAR
- NETLIB LP Test Set
- 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
- A primal deficient-basis simplex algorithm for linear programming
- 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
- A fast simplex algorithm for linear programming
- 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
- MPSGE
- MILES
- PARSMI
- SYNPLEX
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- The positive edge criterion within COIN-OR's CLP
- PyCPX
- PyLPSolve
- Computing in operations research using Julia
- LPKIT
- CyLP
- Solving Real-World Linear Programs: A Decade and More of Progress
- Nonadjacent extreme point methods for solving linear programs
- scientific article; zbMATH DE number 3943568 (Why is no real title available?)
- On Estimating Optimal Bases for Linear Programs
- scientific article; zbMATH DE number 3978292 (Why is no real title available?)
- The Efficiency of the Simplex Method: A Survey
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- On scaling linear programs—some experimental results
- scientific article; zbMATH DE number 3668316 (Why is no real title available?)
- A bump triangular dynamic factorization algorithm for the simplex method
- scientific article; zbMATH DE number 3679541 (Why is no real title available?)
- A degeneracy exploiting LU factorization for the simplex method
- A practicable steepest-edge simplex algorithm
- Heuristische Lösungsverfahren Versuch einer Begriffsklärung
- scientific article; zbMATH DE number 3538744 (Why is no real title available?)
- scientific article; zbMATH DE number 3561076 (Why is no real title available?)
- Experiments in mixed-integer linear programming using pseudo-costs
- On the Bartels—Golub decomposition for linear programming bases
- Robust implementation of Lemke's method for the linear complementarity problem
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Testing of a large-scale network optimization program
- A Spike Collective Dynamic Factorization Algorithm for the Simplex Method
- ParISS
This page was built for software: DEVEX
