El metodo de Karmarkar: Un estudio de sus variantes
From MaRDI portal
Publication:3360002
DOI10.1007/BF02888581zbMATH Open0732.90062OpenAlexW1572091810MaRDI QIDQ3360002FDOQ3360002
Authors: C. González-Martín, M. Sánchez García 
Publication date: 1991
Published in: Trabajos de Investigacion Operativa (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02888581
Recommendations
Cites Work
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A relaxed version of Karmarkar's method
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A monotonic projective algorithm for fractional linear programming
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- Computing Karmarkar projections quickly
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- A variable-metric variant of the Karmarkar algorithm for linear programming
- Exploiting special structure in Karmarkar's linear programming algorithm
- A reduced-gradient variant of Karmarkar's algorithm and null-space projections
- An experimental approach to karmarkar’s projective method for linear programming
- An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
Cited In (1)
This page was built for publication: El metodo de Karmarkar: Un estudio de sus variantes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3360002)
