LIST OF PUBLICATIONS
of Nguyen Van Thoai

TEXT BOOK:
  1. Introduction to Global Optimization . Kluwer Academic Publishers, 1995, (with R. Horst and M. Pardalos).
  2. Introduction to Global Optimization/ 2nd, extended Edition. Kluwer Academic Publishers, 2000.
    3. Chinese Edition (translated by H. Huang) . Tsinghua University Press, Beijing, 2003.
PAPERS (Published and accepted for Publication) :
  1. Solution Methods for General Quadratic Programming Problem with Continuous and Binary Variables: Overview
    In: Ngoc Thanh Nguyen, T. van Do, and H.A. Le Thi (Eds.): Advanced Computational Methods for Knowledge Engineering,
    Studies in Computational Intelligence, Vol. 479, pp. 3-17, Springer-Verlag Berlin Heidelberg, 2013

  2. Branch and Bound Algorithm Using Cutting Angle Method for Global Minimization of Increasing Positively Homogeneous Functions.
    In: Ngoc Thanh Nguyen, T. van Do, and H.A. Le Thi (Eds.): Advanced Computational Methods for Knowledge Engineering,
    Studies in Computational Intelligence, Vol. 479, pp. 19-30, Springer-Verlag Berlin Heidelberg, 2013

  3. Criteria and Dimension Reduction of Linear Multiple Criteria Optimization Problems.
    Journal of Global Optimization, Vol. 52, 499-508, 2012.

  4. Reverse Convex Programming Approach in the Space of Extreme Criteria for Optimization over the Efficient Sets.
    Journal of Optimization Theory and Applications, Vol. 147, p. 263-277, 2010.

  5. Global Optimization Algorithm for Solving Bilevel Programming Problems with Quadratic Lower Levels.
    Journal of Industrial and Management Optimization, Vol.6, p.177-196, 2010. (Joint paper with P. Hermanns).

  6. DC Programming Techniques for Solving a Class of Nonlinear Bilevel Programs.
    Journal of Global Optimization, Vol.44, p.313-337, 2009. (Joint paper with Lethi et. al.)

  7. Decomposition Branch and Bound Algorithm for Optimization Problems over Efficient Sets.
    Journal of Industrial and Management Optimization, Vol.4, p.647-660, 2008.

  8. On Optimization over the Efficient Set in Linear Multicriteria Programming.
    Journal of Optimization Theory and Applications, Vol. 134, p. 433-443, 2007.
    (Joint paper with Horst, Yamamoto, Zenke).

  9. Global Optimization Method for Solving Mathematical Programs with Linear Complementarity Constraints.
    Journal of Optimization Theory and Applications, 124, p. 467-490, 2005. (Joint paper with Yamamoto and Yoshise).

  10. General Quadratic Programming. In: C. Audet, P. Hansen, and G. Savard (eds.), Essays and Surveys in Global Optimization, p. 107-129, Springer, 2005.

  11. Duality Bound Methods in Global Optimization. In: C. Audet, P. Hansen, and G. Savard (eds.), Essays and Surveys in Global Optimization, p. 79-105, Springer, 2005. (Joint paper with R. Horst).

  12. Branch and Bound Methods Using Duality Bounds for Global Optimization. In: Le Thi Hoai An and Pham Dinh Tao (eds.), Modelling Computation and Optimization in Information Systems and Management Sciences, p. 28-36, Hermes Science Publishing, 2004. (Joint paper with R. Horst).

  13. Global Optimization Method for Solving the Minimum Maximal Flow Problem.
    Optimization Methods and Software, 18, p. 395-415, 2003. (Joint paper with Gotoh and Yamamoto).

  14. Combination between Global and Local Methods for Solving an Optimization Problem over the Efficient Set.
    European Journal of Operational Research 142, p. 258-270, 2002. (With Le Thi Hoai An and Pham Dinh Tao).

  15. Convergence and Application of a Decomposition Method Using Duality Bounds for Nonconvex Global Optimization,
    Journal of Optimization Theory and Applications 113, pp. 165-193, 2002.

  16. Convergence of Duality Bound Method in Partly Convex Programming Problem,
    Journal of Global Optimization 22, pp. 263-270, 2002.

  17. Editorial: Special Volume: Dedicated to Prof. Reiner Horst on his 60th Birthday (Editors: P.M. Pardalos and N.V. Thoai) Journal of Global Optimization 22, Nos. 1-4 (2002).

  18. Global Optimization Methods for Systems of Nonlinear Equations, in `Encyclopedia of Optimization' Vol. 2, pp. 338-339, edited by C. Floudas and P. Pardalos, Kluwer Academic Publishers, 2001.

  19. D.C. Programming, in `Encyclopedia of Optimization' Vol. 1, pp. 375-379, edited by C. Floudas and P. Pardalos, Kluwer Academic Publishers, 2001.

  20. Solving Sum-of-Ratios Fractional Programs Using efficient Points, (with M. Dür and R. Horst), Optimization 49 (2001) 447-466.

  21. Conical Algorithm in Global Optimization for Optimizing over Efficient Sets, Journal of Global Optimization 18 (2000) 321-336.

  22. Finite exact branch-and-bound algorithms for concave minimization over polytopes (with M. Locatelli), Journal of Global Optimization 18 (2000) 107-128.

  23. Duality Bound Method for the General Quadratic Programming Problem with Quadratic Constraints. Journal of Optimization Theory and Applications 107 (2000) 331-354.

  24. A Class of Optimization Problems over the Efficient Set of a Multiple Criteria Nonlinear Programming Problem. European Journal of Operational Research 122 (2000) 58-68.

  25. D.C. Programming: Overview , (with R. Horst), Journal of Optimization Theory and Applications 103 (1999) 1-43.

  26. Maximizing a Concave Function over the Efficient or Weackly-Efficient Set, (with R. Horst), European Journal of Operational Research 117 (1999), 239-252.

  27. Editorial: Special Issue: Selected Papers of the Workshop on Global Optimization, Trier 1997 (Editors: R. Horst and N.V. Thoai) Journal of Global Optimization 13, Nr. 4. (1998).

  28. On Thikhonov's Reciprocity Principle and Optimality Conditions in D.C. Optimization, Journal of Mathematical Analysis and Applications 225 (1998) 673-678.

  29. An Interger Concave Minimization Approach for the Minimum Concave Cost Capacitated Flow Problem on Network, (with R. Horst). OR Spektrum 20 (1998), 47-53.

  30. Global Optimization Techniques for Solving the General Quadratic Integer Programming Problem. Computational Optimization and Applications 10 (1998), 149-163.

  31. Utility function programs and optimization over the efficient set in multiple objective decision making. Journal of Optimization Theory and Applications 92 (1997), 469-486. (with R. Horst)

  32. A new algorithm for solving the general quadratic programming problem. Computational Optimization and Applications 5 (1996) 39-49, (with R. Horst).

  33. A decomposition approach for the global minimization of biconcave functions over polytopes. Journal of Optimization Theory and Applications 88 (1996), 561-583, (with R. Horst).

  34. Global minimization of separable concave functions under linear constraints with totally unimodular matrices. In: C. Floudas and P. Pardalos (Eds.), State of the Art in Global Optimization : Computational Methods and Applications, Kluwer Academic Publishers, 1995, 35-45, (with Horst)

  35. New LP-bound in multivariate Lipschitz optimimization: Theory and Applications. Journal of Optimization Theory and Applications 86 (1995) 369-388, (with R. Horst and M. Nast).

  36. Constraint decomposition algorithms in global optimization. Journal of Global Optimization 5 (1994) 333-348, (with R. Horst).

  37. On the construction of test problems for concave minimization algorithms. Journal of Global Optimization 5 (1994) 399-402.

  38. Employment of conical algorithm and outer approximation method in d.c. programming. Journal of Mathematics 22 (1994) 71-85.

  39. Global optimization and the geometric complementarity problem. In W.E. Diewert, K. Spremann and F. Stehling (Eds.): Mathematical Modelling in Economics, Springer-Verlag, 1993, 414-422, (with R. Horst).

  40. Canonical d.c. programming techniques for solving a convex program with an additional constraint of multiplicative type. Computing 50(1993) 241-253.

  41. Conical algorithms for the global minimization of linearly constrained decomposable concave minimization problems. Journal Optimiztion Theory and Applications 74 (1992) 469-486, (with R.Horst).

  42. On geometry and convergence of a class of simplicial covers. Optimization 25(1992) 53-64, (with R.Horst and J.deVries).

  43. A new simplicial cover technique in constrained global optimization. J. Global Optimization 2 (1992) 1-19, (with R.Horst and J.deVries).

  44. A global optimization approach for solving the convex multiplicative programming problem. J. Global Optimization 1 (1991) 341-357.

  45. On solving a d.c. programming problem by a sequence of linear programs. J. Global Optimization 1 (1991),183-203, (with R. Horst et al).

  46. On solving general reverse convex programming problems by a sequence of linear programs and line searches. Annals of Operations Research 25 (1990), 1-18, (with R.Horst, T.Q.Phong).

  47. Implementation, modification and comparision of some algorithms for concave minimization problems. Computing 42 (1989), 271-289, (with R.Horst).

  48. Numerical experiments on concave mininization problems. Methods of Operations Research 60 (1988), 363-365, (with J.de Vries).

  49. Concave minimization via conical partitions and polyhedral outer approximation. Mathematical Programming 50 (1991), 259-274, (with R.Horst and H.P.Benson).

  50. On methods for solving optimization problems without using devatives. In ``Nondifferentiable Optimization''. Lecture Notes in Economics and Mathematical Systems 225,Springer Verlag 1985, 230-236, (with K.Lommatzsch).

  51. On canonical d.c. programs and applications. In `` Essays on Nonlinear Analysis and Optimization Problems''. National Center for Scientific Research. Hanoi 1987, 88-100.

  52. Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities. Journal Opt. Theory and Appl.58 (1988), 139-146, (with R.Horst).

  53. On a class of global optimization problems. Methods of O.R. 58, Eds. P. Kleinschmidt, F.J. Radermacher, W. Schweitzer, H. Wildemann, (1989), pp. 115-130.

  54. On an outer approximation concept in global optimization. Optimization 20 (1989), 255-264, (with R.Horst,H.Tuy).

  55. On finding new vertices and redundant constraints in cutting plane algorithms for global optimization. O.R. Letters 7 (1988), 85-90, (with R.Horst,J.d.Vries).

  56. Outer aproximation by polyhedral convex sets. O.R.Spektrum Vol.9 (1987) 153-159, (with R.Horst,H.Tuy).

  57. A modified version of Tuy's method for solving d.c. programming problems. Optimization Vol.19 (1988) 665-674.

  58. Verfahren zur Loesung konkaver Optimierungsaufgaben. Seminarberichte Nr.63 (95 pages) (1984) Humboldt-Universitaet zu Berlin.

  59. Verfahren zur Loesung konkaver Optimierungsaufgaben auf der Basis eines verallgemeinerten Erweiterungsprinzips. Habilitation Thesis, Humboldt-Universitaet zu Berlin (1984).

  60. Solving the linear complementarity problem through concave programming. J.Vytsysl.Mat.i Mat.Phys.T.23 (1983), 602-608, (with H.Tuy).

  61. Algorithms for solving a class of non-convex programs and complementarity problems. Thesis, Institute of Mathematics, Hanoi(1982)

  62. Anwendung des Erweiterungsprinzips zur Loesung konkaver Optimierungsaufgaben. M.O.S. Ser. Optimization Vol.11 (1981) 45-51.

  63. Convergent algoritms for minimizing a concave function. Mathematics of O.R. Vol.5 (1980) 556-566, (with H.Tuy).

  64. Solving the linear complementarity problem via concave programming. Methods of O.R.,Ed. R.R.Burkard,T.Elinger (1980), (with H.Tuy).

  65. A modification of Scarf's algorithm allowing restarting. M.O.S. Ser. Optimization Vol.9 (1978) 357-372, (with H.Tuy,L.D.Muu).

  66. Un nouvel algorithme de point fixe. C.R.Acad.Sc.Paris,t.268( 1978), Ser.A,783-785, (joint paper with H.Tuy and L.D.Muu).

Prof. Dr. Nguyen van Thoai
Department of Mathematics
University of Trier
D-54286 Trier, Germany
e.mail: thoai@uni-trier.de