1. A new polynomial-time algorithm for linear programming;Karmarkar;Combinatorica,1984
2. Theory and Algorithms for Linear Optimization: An Interior Point Approach;Roos,2005
3. Interior-point path following primal–dual algorithms: part I: linear programming;Monteiro;Mathematical Programming,1989
4. An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming;Sonnevend,1986
5. Pathways to the optimal set in linear programming;Megiddo,1989