Le Thi Hoai An

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Viet Nga Pham

> Home > Persons > Le Thi Hoai An

Publications

2016
[j73]
- view
  authority control:
- export record
  dblp key:
  - journals/ol/DinhTPN16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/DinhTPN16
Tao Pham Dinh, Hoai An Le Thi, Viet Nga Pham, Yi-Shuai Niu:
DC programming approaches for discrete portfolio optimization under concave transaction costs. Optim. Lett. 10(2): 261-282 (2016)
2014
[c52]
- view
  authority control:
- export record
  dblp key:
  - conf/aciids/DinhPT14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aciids/DinhPT14
Tao Pham Dinh, Viet Nga Pham, Hoai An Le Thi:
DC Programming and DCA for Portfolio Optimization with Linear and Fixed Transaction Costs. ACIIDS (2) 2014: 392-402
2013
[p4]
- view
  authority control:
- export record
  dblp key:
  - series/sci/PhamTT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/series/sci/PhamTT13
Viet Nga Pham, Hoai An Le Thi, Pham Dinh Tao:
A DC Programming Framework for Portfolio Selection by Minimizing the Transaction Costs. Advanced Computational Methods for Knowledge Engineering 2013: 31-40
2012
[c36]
- view
  authority control:
- export record
  dblp key:
  - conf/iccci/PhamTD12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccci/PhamTD12
Viet Nga Pham, Le Thi Hoai An, Tao Pham Dinh:
Solving Nurse Rostering Problems by a Multiobjective Programming Approach. ICCCI (1) 2012: 544-552

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.