Puget, J.F. and Lustig, I.J. (2001). "Constraint programming and maths programming," The Knowledge Engineering Review 16(1), 5-23.
Lustig, I.J. and Rothberg, E. (1996). "Gigaflops in Linear Programming", Operations Research Letters 18(4), 157-165.
Lustig, I.J., Marsten, R. and Shanno, D.F. (1994). "Interior Point Methods for Linear Programming: Computational State of the Art," ORSA Journal on Computing 6(1), 1-14.
Lustig, I.J., Marsten, R. and Shanno, D.F. (1994). "The Last Word on Interior Point Methods for Linear Programming-For Now," Rejoinder, ORSA Journal on Computing 6(1), 35.
Lustig, I.J., Marsten, R. and Shanno, D.F. (1992). "Computational Experience with a Globally Convergent Primal-Dual Predictor-Corrector Algorithm for Linear Programming," Mathematical Programming 66, 123-135.
Jones, K.L., Lustig, I.J., Farvolden, J.M., and Powell W.B. (1993). "Multicommodity network flows: The impact of formulation on decomposition," Mathematical Programming 62, 95-117.
Carpenter, T.J., Lustig, I.J., Mulvey, J. and Shanno, D.F. (1993). "Higher Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives," SIAM Journal on Optimization 3, 696-725.
Carpenter, T.J., Lustig, I.J., Mulvey, J.M. and Shanno, D.F. (1993). "Separable quadratic programming via a primal-dual interior point method and its use in a sequential procedure", ORSA Journal on Computing 5(2), 182-191.
Lustig, I.J. and Li, G. (1992). "An implementation of a parallel primal-dual interior point method for multicommodity flow problems," Computational Optimization and its Applications 1(2), 141-161.
Bixby, R.E., Gregory, J.W., Lustig, I.J., Marsten, R.E., and Shanno, D.F. (1992). "Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods," Operations Research 40(5), 885-897.
Lustig, I.J., Marsten, R. and Shanno, D.F. (1992). "On implementing Mehrotra's predictor-corrector interior point method for linear programming," SIAM Journal on Optimization 2(3), 435-449.
Astfalk, G., Lustig, I.J., Marsten, R. and Shanno, D.F. (1992). "The interior-point method for linear programming," IEEE Software 9(4), 61-68.
Lustig, I.J., Marsten, R. and Shanno, D.F. (1991). "Computational experience with a primal-dual interior point method for linear programming," Linear Algebra and its Applications 152, 191-222.
Lustig, I.J., Mulvey, J.M., and Carpenter, T.J. (1991). "Formulating two-stage stochastic programs for interior point methods," Operations Research, 39(5), 757-770.
Lustig, I.J. (1990). "Feasibility issues in a primal-dual interior point method for linear programming," Mathematical Programming, 49(2), 145-162.
Marsten, R., Subramanian, R., Saltzman, M., Lustig, I., and Shanno, D. (1990). "Interior point methods for linear programming: Just call Newton, Lagrange, and Fiacco and McCormick!," Interfaces, 20(4), 105-116.
Lustig, I.J. (1990). "The influence of computer language on computational comparisons: an example from network optimization," ORSA Journal on Computing, 2, 152-161.
Lustig, I.J. (1989). "An analysis of an available set of linear programming test problems," Computers and Operations Research, 16, 173-184.
Lustig, I.J., Marsten, R. and Shanno, D.F. (1992). "The Interaction of Algorithms and Architectures for Interior Point Methods,"Advances in Optimization and Parallel Computing, (P.M. Pardalos, ed.), North-Holland, NY, pp. 190-205.
Lustig, I.J. (1989). "Applications of interactive computer graphics to linear programming," In: Impacts of Recent Computer Advances on Operations Research, (R.S. Sharda, B.L. Golden, E. Wasil, O. Balci, W. Stewart, eds.), North-Holland, NY, 183-189.
Lustig, I.J. (1988). "Phase 1 search directions for a primal-dual interior point method for linear programming," AMS-IMS-SIAM Joint Summer Research Conference on Mathematical Developments Arising from Linear Programming, (J.C. Lagarias, and M.J. Todd, eds.), American Mathematical Society, Providence, 121-130.
Cheung, R.K.M., Lustig, I., Kornhauser, A.L. (1990). "Relative effectiveness of training set patterns for back propagation," Proceedings of the International Joint Conference on Neural Networks, Volume I, 673-678.
Lustig, I.J., Parrish, J.N., Augenstein, J.S., Civetta, J.M., Rodman, G.H., Jr., and Caruthers, T.E. (1981). "Clinical experience with a minicomputer based data management system in surgical intensive care," Computers in Critical Care and Pulmonary Medicine.
Augenstein, J.S., Civetta, J.M., Andrews, G.F., and Lustig, I. (1980). "Clinical experience with a microcomputer-based intensive care data management system," Computers in Critical Care and Pulmonary Medicine, 265-267.
Augenstein, J.S., Civetta, J.M., Andrews, G.F., and Lustig, I. (1979). "Clinical experience with a microcomputer-based intensive care data management system," Personal Computer Proceedings- National Computer Conference, p.431.
Augenstein, J.S., Civetta, J.M., Andrews, G.F., and Lustig, I. (1979). "Clinical experience with a distributed intelligence intensive care data management system," Computers in Cardiology, 447-448.
Lustig, I.J. (2001). "Optimization and Java," Java Developer's Journal 6(6), 110-116.
Lustig, I.J. (1992). "Workstations: How to Choose the Right Machine," OR/MS Today 19(6), 50-56.
Lustig, I.J. (1988). "An experimental analysis of the convergence rate of an interior point algorithm," Report No. SOR 88-5, Program in Statistics and Operations Research, Department of Civil Engineering and Operations Research, School of Engineering and Applied Science, Princeton University, Princeton, NJ.
Lustig, I.J. (1988). "A generic primal-dual interior point algorithm," Report No. SOR 88-3, Program in Statistics and Operations Research, Department of Civil Engineering and Operations Research, School of Engineering and Applied Science, Princeton University, Princeton, NJ.
Lustig, I.J. (1987). "Comparisons of composite simplex algorithms," Report No. SOL 87-8, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA.
Lustig, I.J. (1987). "The equivalence of Dantzig's self-dual parametric algorithm for linear programming and Lemke's algorithm for linear complementarity problems applied to linear programs," Report No. SOL 87-4, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA.
Lustig, I.J. (1985). "A practical approach to Karmarkar's algorithm," Report No. SOL 85-5, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA.