Solving combinatorial optimization problems using Karmarkar's algorithm

This publication has 30 references indexed in Scilit:

• A potential-function reduction algorithm for solving a linear program directly from an infeasible “warm start”
  Mathematical Programming, 1991
• Further Development of a Primal-Dual Interior Point Method
  INFORMS Journal on Computing, 1990
• An implementation of Karmarkar's algorithm for linear programming
  Mathematical Programming, 1989
• A variant of Karmarkar's linear programming algorithm for problems in standard form
  Mathematical Programming, 1987
• A monotonic projective algorithm for fractional linear programming
  Algorithmica, 1986
• On the use of optimal fractional matchings for solving the (integer) matching problem
  Computing, 1986
• Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations
  SIAM Journal on Scientific and Statistical Computing, 1986
• Solution of sparse linear least squares problems using givens rotations
  Linear Algebra and its Applications, 1980
• Maximum matching and a polyhedron with 0,1-vertices
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
• Paths, Trees, and Flowers
  Canadian Journal of Mathematics, 1965