The Citing articles tool gives a list of articles citing the current article. The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program . You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
Thaï Quynh Phong , Le Thi Hoai An , Pham Dinh Tao
RAIRO-Oper. Res., 30 1 (1996) 31-49
Published online: 2017-02-10
This article has been cited by the following article(s):
7 articles
A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks
Nguyen Canh Nam and Pham Thi Hoai Computers & Operations Research 82 95 (2017) https://doi.org/10.1016/j.cor.2017.01.011
WITHDRAWN: Nonconvex optimization based on DC programming and DCA in the search of a global optimum of a nonconvex function
Fadila Leslous, Philippe Marthon, Oukacha Brahim and Ouanes Mohand Journal of the Egyptian Mathematical Society (2015) https://doi.org/10.1016/j.joems.2015.08.002
A Branch‐and‐Bound Algorithm Embedded with DCA for DC Programming
Meihua Wang, Fengmin Xu, Chengxian Xu and Wanquan Liu Mathematical Problems in Engineering 2012 (1) (2012) https://doi.org/10.1155/2012/364607
New formulations of the multiple sequence alignment problem
Thiru S. Arthanari and Hoai An Le Thi Optimization Letters 5 (1) 27 (2011) https://doi.org/10.1007/s11590-010-0188-8
An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs
Tao Pham Dinh, Nam Nguyen Canh and Hoai An Le Thi Journal of Global Optimization 48 (4) 595 (2010) https://doi.org/10.1007/s10898-009-9507-y
Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
Hoai An Le Thi and Mohand Ouanes RAIRO - Operations Research 40 (3) 285 (2006) https://doi.org/10.1051/ro:2006024
A continuous approch for globally solving linearly constrained quadratic
LE. Thi Hoai An and Pham. Ding Tao Optimization 50 (1-2) 93 (2001) https://doi.org/10.1080/02331930108844555