(with H. Tuy and N. V. Thoai) A modification of Scaf's  algorithm allwing restarting. Optimization  3(1978) 357-362.

(with H. Tuy and N. V. Thoai) Un nouvel algorithme de point fixe. C.R. Acad. Sci. Paris 286(1978) 783-786.

(with D. B. Khang)  Asymtotic regularity and the strong convergence of the proximal point algorithm. Acta  Mathematica Vietnamica 6(1983) 3-11. 

 Stability property of a class of variational inequalities. Optimization 15(1984)347-353. 

 A convergent algorithm for solving linear programs with an additional reverse convex constraint. Kybernetika 91(1986)  418-425.

 An augmented penalty function method for solving a class of  variational inequalities. Soviet Computational Mathematics  and Mathematical Physics 12 (1986) 1788-1796.

 (with W. Oettli ) A lagrangian penalty function method for monotone variational inequalities. Numerical Functional Analysis and Optimization 10 (1989) 1003-1017.

 (with W. Oettli) An algorithm for indefinite quadratic programming with convex constraints. Operations Resarch Letters 10 (1989) 323-327.

 (with W. Oettli) A method for minimizing a convex-concave function over a convex set. J. Optimization Theory and Applications 70 (1990) 377-384.

 On a Lagrangian penalty function method for convex programs.Applied Mathematics and Optimization. 25 (1992) 1-9.

 (with W. Oettli)  Convergence of an adaptive penalty method for monotone variational inequalities and convex optimization.Nonlinear Analysis: Theory, Methods and Applications 18(1992) 1-10.

 (with B.T. Tam) Minimizing the sum of a convex function and  the product of two affine fractional functions over a convex set.Optimization 24 (1992) 57-62.

 An algorithm for solving convex programs with an additional convex-concave constraint. Mathematical Programming 61 (1993)  75-87.

 (with W. Oettli) A combimed branch-and-bound and cutting plane method for solving a certain class of nonconvex optimization problems. J. of Global Optimization 3 (1993) 377-391.

 Convex-concave programming as a decomposition approach to global optimization. Acta Mathematica Vietnamica 18 (1993) 61-77.

 (with R. Horst) Branch-and-bound decomposition approach for solving quasiconvex -  concave programs. J. Optimization Theory and Applications 82 (1994) 267-293.

 (with B. T. Tam) Efficient methods for solving certain  bilinear programming problems. Acta Mathematica Vietnamica 19 (1994) 97-110. 

 (with B. T. Tam and Schaible) Efficient algorithms for  solving certain nonconvex optimization problems dealing with the product of two affine fractional functions. J. of Global Optimization 6 (1995) 179-191.

 (with T. Q. Phong and P. D. Tao) Decomposition methods for  solving a class of nonconvex programming problems dealing with bilinear and quadratic function.  Compuational Optimization and Applications 4(1995) 203-216.

 Computational aspects of optimization over the Efficient Set.Vietnam Journal of Mathematics 23(1995) 85-106.

 (with N. D. Dan) Parametric  simplex method for optimizing a linear function over the efficient set  of a bicriteria linear problem.  Acta Mathematica Vietnamica 21 (1996) 59-67. 

 (with L.T.H. An and P. D. Tao) Numerical solution for optimization over the efficient set by d.c. optimization algorithm. Operations Research  Letter 19(1996) 117-128.

 (with Le Tu Luc) On equivalence between convex maximization and optimization over the efficient set. Vietnam J.  of Mathematics 24(1996)  439-445.

 (with N. A. Tuan and P. C. Duong) An algorithm for finding a global  optimal solution of a water distribution network. Acta Mathematica Vietnamica 21(1996) 309-333.

 (with N.V. Tien) A relaxation algorithm for solving mixed integer programming problems. Acta Mathematica Vietnamica 22(1997) 367-378.

 (with Le T. Luc) Global optimization approach to optimization over the efficient set. in the Proceeding of 8th French-German Conference on Optimization,  Lecture Notes in Economics and Mathematical System 452 (1997) 213-221, Springer Verlag, Berlin.

 (L.T.H. An and P.D. Tao) A combined d.c. optimization-ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems. J. of Combinatorial Optimization 2 (1998)  9-28.

 (with L.T.H. An and P. D. Tao) Exact penalty in d.c. programming. Vietnam J. of Mathematics. 27(1999)169-178.

 (with J. Fulop) Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem.  J. of Optimization Theory and Applications, 105 (2000) 37-54.

 (with W. Oettli) Optimization over equilibrium sets.  Optimization 49(2000) 179-189.

 A convex-concave programming method for optimizing over the effiient set. Acta Mathematica Vietnamica 25(2000) 67-85

 On the construction of initial polyhedral convex set for optimization problems over the efficient set and bilevel linear programs. Vietnam J. of Mathematics, 28(2000) 177-184.

 (with N. V. Quy) On penalty function method for  a class of nonconvex constrained optimization problems. Vietnam J. of Mathematics 29(2001) 235-256.

 (with H. Q. Tuyen) Biconvex programming approach for optimizing over the efficient set of a multiple objective affine fractional programming problem.  Operations Research Letters 28(2001)76-82

 (with N.T. B. Kim)  On the projection of the efficiet set and potential applications. Optimization (accepted)

 (with N. V. Quy)  Method for finding global optimal solution to linear programs with equilibrium constraints.  Institute of  Mathematics, preprint 38/2000. Acta Mathematica Vietnamica (accepted).

 (with N. V. Quy) A global optimization method for solving convex quadratic bilevel programming problems. Institute of Mathematics, preprint 24/2001. J. of Global Optimization (accepted).

 Introduction to Optimization Methods (in Vietnamese) Hanoi Scientific Publishers 1998