scientific article; zbMATH DE number 3614492
From MaRDI portal
Publication:4178772
zbMATH Open0395.90046MaRDI QIDQ4178772FDOQ4178772
Authors: P. M. Harris 
Publication date: 1975
Title of this publication is not available (Why is that?)
Numerical mathematical programming methods (65K05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25)
Cited In (14)
- A computational approach to pivot selection in the LP relaxation of set problems
- An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Improving a primal–dual simplex-type algorithm using interior point methods
- The positive edge criterion within COIN-OR's CLP
- Numerical behavior of LP algorithms based upon the decomposition principle
- A phase-1 approach for the generalized simplex algorithm
- A dual approach to primal degeneracy
- A basis-defiency-allowing variation of the simplex method for linear programming
- On the solution of highly degenerate linear programmes
- Customizing the solution process of COIN-OR's linear solvers with python
- A primal deficient-basis simplex algorithm for linear programming
- Nonadjacent extreme point methods for solving linear programs
- Complexity of the gravitational method for linear programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178772)
