Advanced Search
MyIDEAS: Login

Hoai An Le Thi

Contents:

This is information that was supplied by Hoai An Le Thi in registering through RePEc. If you are Hoai An Le Thi , you may change this information at the RePEc Author Service. Or if you are not registered and would like to be listed as well, register at the RePEc Author Service. When you register or update your RePEc registration, you may identify the papers and articles you have authored.

Personal Details

First Name: Hoai An
Middle Name:
Last Name: Le Thi
Suffix:

RePEc Short-ID: ple493

Email: [This author has chosen not to make the email address public]
Homepage: http://lita.sciences.univ-metz.fr/~lethi/index.html
Postal Address:
Phone:

Affiliation

université Paul Verlaine - Metz (Paul Verlaine university of Metz)
Homepage: http://www.univ-metz.fr/
Location: Metz, France

Works

as in new window

Articles

  1. Tao Pham Dinh & Nam Nguyen Canh & Hoai Le Thi, 2010. "An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs," Journal of Global Optimization, Springer, vol. 48(4), pages 595-632, December.
  2. Hoai Le & Hoai Le Thi & Tao Pham Dinh & Pascal Bouvry, 2010. "A combined DCA: GA for constructing highly nonlinear balanced boolean functions in cryptography," Journal of Global Optimization, Springer, vol. 47(4), pages 597-613, August.
  3. Hoai Le Thi & Mahdi Moeini & Tao Pham Dinh, 2009. "Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA," Computational Management Science, Springer, vol. 6(4), pages 459-475, October.
  4. Tao Pham Dinh & Nguyen Nam & Hoai Le Thi, 2009. "DC programming and DCA for globally solving the value-at-risk," Computational Management Science, Springer, vol. 6(4), pages 477-501, October.
  5. Hoai Le Thi & Hoai Le & Van Nguyen & Tao Pham Dinh, 2008. "A DC programming approach for feature selection in support vector machines learning," Advances in Data Analysis and Classification, Springer, vol. 2(3), pages 259-278, December.
  6. Hoai Le Thi & Tao Pham Dinh & Gunter Ritter, 2008. "Preface for the special issue of ADAC on ‘Optimisation and Non-Convex Programming in Data Mining’," Advances in Data Analysis and Classification, Springer, vol. 2(3), pages 209-210, December.
  7. An, Le Thi Hoai & Tao, Pham Dinh & Thoai, Nguyen Van, 2007. "Editorial," European Journal of Operational Research, Elsevier, vol. 183(3), pages 949, December.
  8. Hoai An, Le Thi & Phuc, Nguyen Trong & Tao, Pham Dinh, 2007. "A continuous DC programming approach to the strategic supply chain design problem from qualified partner set," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1001-1012, December.
  9. Hoai An, Le Thi & Minh, Le Hoai & Tao, Pham Dinh, 2007. "Optimization based DC programming and DCA for hierarchical clustering," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1067-1085, December.
  10. Le Thi, Hoai An & Pham, Dinh Tao & Thoai, Nguyen V., 2002. "Combination between global and local methods for solving an optimization problem over the efficient set," European Journal of Operational Research, Elsevier, vol. 142(2), pages 258-270, October.

Statistics

Most cited item

Most downloaded item (past 12 months)

Access and download statistics for all items

Corrections

For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Hoai An Le Thi should log into the RePEc Author Service

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.