DEVEX
From MaRDI portal
Software:20387
swMATH8378MaRDI QIDQ20387FDOQ20387
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Title not available (Why is that?)
- Heuristische Lösungsverfahren Versuch einer Begriffsklärung
- Numerical aspects in developing LP softwares, LPAKO and LPABO
- Primal-dual methods for sustainable harvest scheduling problems
- A new steepest edge approximation for the simplex method for linear programming
- A practical anti-degeneracy row selection technique in network linear programming
- Implementation of an interior point method with basis preconditioning
- Recovering an optimal LP basis from an interior point solution
- Title not available (Why is that?)
- Empirical column selection method in the simplex method
- Solving linear programs with multiple right-hand sides: Pricing and ordering schemes
- A Spike Collective Dynamic Factorization Algorithm for the Simplex Method
- Encounters with degeneracy: A personal view
- Adjacent vertex simplex algorithms: More experimental results on random problems
- Title not available (Why is that?)
- Resolving degeneracy in combinatorial linear programs: Steepest edge, steepest ascent, and parametric ascent
- On Estimating Optimal Bases for Linear Programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of the gravitational method for linear programming
- Improved primal simplex: a more general theoretical framework and an extended experimental analysis
- A computational approach to pivot selection in the LP relaxation of set problems
- A pathsearch damped Newton method for computing general equilibria
- A survey of the operational use of ILP models
- Solving Real-World Linear Programs: A Decade and More of Progress
- Computational study of the GDPO dual phase-1 algorithm
- Experiments in mixed-integer linear programming using pseudo-costs
- On scaling linear programs—some experimental results
- A largest-distance pivot rule for the simplex algorithm
- A new local dimming algorithm based on the simplex method
- Degeneracy in the presence of roundoff errors
- A projective simplex algorithm using LU decomposition
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- A degeneracy exploiting LU factorization for the simplex method
- A practicable steepest-edge simplex algorithm
- Pivot selection methods of the Devex LP code
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Experiments with external pivoting
- Testing of a large-scale network optimization program
- Practical bilevel optimization. Algorithms and applications
- Resolving degeneracy in quadratic programming
- Efficient nested pricing in the simplex algorithm
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- A Fast Algorithm for Linear Programming
- Computing in Operations Research Using Julia
- Title not available (Why is that?)
- Solving staircase linear programs by the simplex method, 2: Pricing
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- The fleet assignment problem: Solving a large scale integer program
- Title not available (Why is that?)
- Parallel distributed-memory simplex for large-scale stochastic LP problems
- Primal and dual active-set methods for convex quadratic programming
- A linear programming decomposition focusing on the span of the nondegenerate columns
- Improving a primal–dual simplex-type algorithm using interior point methods
- LPAKO: A Simplex-based Linear Programming Program
- The positive edge criterion within COIN-OR's CLP
- A dual projective simplex method for linear programming
- A Revised Dual Projective Pivot Algorithm for Linear Programming
- Degeneracy graphs: Theory and applications. An updated survey
- On pricing and backward transformation in linear programming
- Implementation aids for optimization algorithms that solve sequences of linear programs
- On the Bartels—Golub decomposition for linear programming bases
- Vector processing in simplex and interior methods for linear programming
- A brief history of linear and mixed-integer programming computation
- The simplex method is not always well behaved
- A general phase-I method in linear programming
- Robust implementation of Lemke's method for the linear complementarity problem
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Pivot rules for linear programming: A survey on recent theoretical developments
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
- Numerical behavior of LP algorithms based upon the decomposition principle
- A practical anti-cycling procedure for linearly constrained optimization
- Towards a practical parallelisation of the simplex method
- Selected bibliography on degeneracy
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- A phase-1 approach for the generalized simplex algorithm
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- qpOASES: a parametric active-set algorithm for~quadratic programming
- A dual approach to primal degeneracy
- A basis-defiency-allowing variation of the simplex method for linear programming
- Advances in design and implementation of optimization software
- ASYNPLEX, an asynchronous parallel revised simplex algorithm
- A bump triangular dynamic factorization algorithm for the simplex method
- MOPS -- Mathematical optimization system
- An efficient approach to updating simplex multipliers in the simplex algorithm
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- On the solution of highly degenerate linear programmes
- Hyper-sparsity in the revised simplex method and how to exploit it
- The long step rule in the bounded-variable dual simplex method: Numerical experiments
- Combining Interior-Point and Pivoting Algorithms for Linear Programming
- Steepest-edge simplex algorithms for linear programming
- Customizing the solution process of COIN-OR's linear solvers with python
- Parallelizing the dual revised simplex method
- The Efficiency of the Simplex Method: A Survey
- A primal deficient-basis simplex algorithm for linear programming
- Advances in the Optimization of Airline Fleet Assignment
- Nonadjacent extreme point methods for solving linear programs
This page was built for software: DEVEX