The following publications are possibly variants of this publication:
- Solving QoS Routing Problems by DCATa Anh Son, Le Thi Hoai An, Djamel Khadraoui, Pham Dinh Tao. aciids 2010: 460-470 [doi]
- A continuous approach for the concave cost supply problem via DC programming and DCALe Thi Hoai An, Pham Dinh Tao. DAM, 156(3):325-338, 2008. [doi]
- On solving Linear Complementarity Problems by DC programming and DCALe Thi Hoai An, Pham Dinh Tao. coap, 50(3):507-524, 2011. [doi]
- A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market OpportunityNguyen Nam, Le Thi Hoai An, Pham Dinh Tao. or 2007: 515-520 [doi]
- Solving the Perceptron Problem by deterministic optimization approach based on DC programming and DCALe Thi Hoai An, Le Hoai Minh, Pham Dinh Tao, Pascal Bouvry. indin 2009: 222-226 [doi]
- Minimum Sum-of-Squares Clustering by DC Programming and DCALe Thi Hoai An, Pham Dinh Tao. icic 2009: 327-340 [doi]
- The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization ProblemsLe Thi Hoai An, Pham Dinh Tao. anor, 133(1-4):23-46, 2005. [doi]
- A continuous DC programming approach to the strategic supply chain design problem from qualified partner setLe Thi Hoai An, Nguyen Trong Phuc, Pham Dinh Tao. eor, 183(3):1001-1012, 2007. [doi]
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCAJulien Schleich, Le Thi Hoai An, Pascal Bouvry. jco, 24(4):397-412, 2012. [doi]