H. A. Le-thi and N. V. Vinh, Phan Din: A Combined DCA and New Cutting Plane Techniques for Globally Solving Mixed Linear Programming, SIAM Conference on Optimization, 2005.

P. Hartman, On functions representable as a difference of convex functions, Pacific Journal of Mathematics, vol.9, issue.3, pp.707-713, 1959.
DOI : 10.2140/pjm.1959.9.707

R. Horst and T. Hoang, Global Optimization : Deterministic Approaches, 2nd revised edition, 1993.

L. The and H. , A: Solving large scale molecular distance geometry problems by a smoothing technique via the gaussian transform and d.c. programming, Journal of Global Optimization, vol.27, issue.4, pp.375-397, 2003.

L. T. Nguyen-canh-nam and H. An, Phan Din Tao : A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in supply Chain Design for a New Market Opportunity, 2006.

Y. S. Niu and T. Pham-din, A DC Programming Approach for Mixed-Integer Linear Programs. Computation and Optimization in Information Systems and Management Sciences, Book Series: Communications in Computer and Information Science, pp.244-253, 2008.

P. Parpas and B. Rustem, Global Optimization of the Scenario Generation and Portfolio Selection Problems, Lecture Notes in Computer Science, vol.3982, pp.908-917, 2006.
DOI : 10.1007/11751595_95

P. Dinh and T. , Algorithms for solving a class of non convex optimization problems. Methods of subgradients. Fermat days 85 Mthematics for optimization, 1986.

P. Din and T. , Duality in d.c (difference of convex functions) optimization . Subgradient methods, Trends in Mathematical Optimization, K.H

P. Dinh, T. , L. T. , and H. An, Stabilité de la dualite lagrangienne en optimisation d.c. (difference de deux fonctions convexes), C.R.Acad, 1994.

P. Dinh, T. , L. Thi, and H. A. , Convex analysis approach to D.C programming: Theory, Algorithms and Application, Acta Mathamatica Vietnamica, vol.22, issue.1, pp.289-355, 1997.

P. Dinh, T. , L. Thi, and H. A. , DC Programming. Theory, Algorithms, Applications: The state of the Art. First International Whorkshop on global Constrained Optimization and Constraint Satisfaction, 2002.