DEVEX
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Efficient nested pricing in the simplex algorithm
- A phase-1 approach for the generalized simplex algorithm
- A degeneracy exploiting LU factorization for the simplex method
- A practicable steepest-edge simplex algorithm
- A largest-distance pivot rule for the simplex algorithm
- A Revised Dual Projective Pivot Algorithm for Linear Programming
- Advances in the Optimization of Airline Fleet Assignment
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
- Improved primal simplex: a more general theoretical framework and an extended experimental analysis
- A dual approach to primal degeneracy
- A new local dimming algorithm based on the simplex method
- A practical anti-cycling procedure for linearly constrained optimization
- The Efficiency of the Simplex Method: A Survey
- A primal deficient-basis simplex algorithm for linear programming
- A pathsearch damped Newton method for computing general equilibria
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Customizing the solution process of COIN-OR's linear solvers with python
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- Computing in operations research using Julia
- ASYNPLEX, an asynchronous parallel revised simplex algorithm
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- Parallelizing the dual revised simplex method
- A bump triangular dynamic factorization algorithm for the simplex method
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Experiments with external pivoting
- A brief history of linear and mixed-integer programming computation
- The simplex method is not always well behaved
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- Degeneracy in the presence of roundoff errors
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Towards a practical parallelisation of the simplex method
- On the solution of highly degenerate linear programmes
- Pivot rules for linear programming: A survey on recent theoretical developments
- Nonadjacent extreme point methods for solving linear programs
- Selected bibliography on degeneracy
- Pivot selection methods of the Devex LP code
- A basis-defiency-allowing variation of the simplex method for linear programming
- Steepest-edge simplex algorithms for linear programming
- BPMPD
- LPABO
- LPAKO
- A fast simplex algorithm for linear programming
- PIPS
- SCICONIC
- ASYNPLEX
- KORBX
- SoPlex
- COPL_QP
- MINOS
- PyCOIN
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- QPSchur
- LSSOL
- Dsor
- MOPS
- OSL
- SIMPAR
- NETLIB LP Test Set
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- MILES
- MPSGE
- PARSMI
- SYNPLEX
- PyCPX
- PyLPSolve
- LPKIT
- CyLP
- ParISS
- scientific article; zbMATH DE number 3943568 (Why is no real title available?)
- Hyper-sparsity in the revised simplex method and how to exploit it
- Primal and dual active-set methods for convex quadratic programming
- Implementation aids for optimization algorithms that solve sequences of linear programs
- Testing of a large-scale network optimization program
- Solving Real-World Linear Programs: A Decade and More of Progress
- A linear programming decomposition focusing on the span of the nondegenerate columns
- The fleet assignment problem: Solving a large scale integer program
- Practical bilevel optimization. Algorithms and applications
- Experiments in mixed-integer linear programming using pseudo-costs
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Solving staircase linear programs by the simplex method, 2: Pricing
- Improving a primal–dual simplex-type algorithm using interior point methods
- scientific article; zbMATH DE number 1546510 (Why is no real title available?)
- A survey of the operational use of ILP models
- On scaling linear programs—some experimental results
- LPAKO: A Simplex-based Linear Programming Program
- The positive edge criterion within COIN-OR's CLP
- A dual projective simplex method for linear programming
- The long step rule in the bounded-variable dual simplex method: Numerical experiments
- Resolving degeneracy in quadratic programming
- MOPS -- Mathematical optimization system
- Parallel distributed-memory simplex for large-scale stochastic LP problems
- A projective simplex algorithm using LU decomposition
- Resolving degeneracy in combinatorial linear programs: Steepest edge, steepest ascent, and parametric ascent
- Heuristische Lösungsverfahren Versuch einer Begriffsklärung
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- A computational approach to pivot selection in the LP relaxation of set problems
- Adjacent vertex simplex algorithms: More experimental results on random problems
- Numerical aspects in developing LP softwares, LPAKO and LPABO
- A practical anti-degeneracy row selection technique in network linear programming
This page was built for software: DEVEX
