default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNguyen V. Thoai
Person information
- affiliation: University of Trier, Department of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[p2]Nguyen V. Thoai:
Solution Methods for General Quadratic Programming Problem with Continuous and Binary Variables: Overview. Advanced Computational Methods for Knowledge Engineering 2013: 3-17- [p1]Nguyen V. Thoai:
Branch and Bound Algorithm Using Cutting Angle Method for Global Minimization of Increasing Positively Homogeneous Functions. Advanced Computational Methods for Knowledge Engineering 2013: 19-30 - 2012
- [j22]Nguyen V. Thoai, Harold P. Benson, Panos M. Pardalos:
Preface. J. Glob. Optim. 52(3): 369-370 (2012) - [j21]Nguyen V. Thoai:
Criteria and dimension reduction of linear multiple criteria optimization problems. J. Glob. Optim. 52(3): 499-508 (2012) - 2010
- [j20]Nguyen V. Thoai:
Reverse Convex Programming Approach in the Space of Extreme Criteria for Optimization over Efficient Sets. J. Optim. Theory Appl. 147(2): 263-277 (2010)
2000 – 2009
- 2009
- [j19]Le Thi Hoai An
, Pham Dinh Tao, Nam Nguyen Canh, Nguyen V. Thoai:
DC programming techniques for solving a class of nonlinear bilevel programs. J. Glob. Optim. 44(3): 313-337 (2009) - [r1]Nguyen V. Thoai:
Global Optimization Methods for Systems of Nonlinear Equations. Encyclopedia of Optimization 2009: 1364-1366 - 2007
- [j18]Le Thi Hoai An, Pham Dinh Tao, Nguyen V. Thoai:
Editorial. Eur. J. Oper. Res. 183(3): 949 (2007) - 2003
- [j17]Jun-ya Gotoh, Nguyen Van Thoai, Yoshitsugu Yamamoto:
Global optimization method for solving the minimum maximal flow problem. Optim. Methods Softw. 18(4): 395-415 (2003) - 2002
- [j16]Le Thi Hoai An, Pham Dinh Tao, Nguyen V. Thoai:
Combination between global and local methods for solving an optimization problem over the efficient set. Eur. J. Oper. Res. 142(2): 258-270 (2002) - [j15]Nguyen Van Thoai:
Convergence of duality bound method in partly convex programming. J. Glob. Optim. 22(1-4): 263-270 (2002) - [i12]Paul B. Hermanns, Nguyen V. Thoai:
Method for Global Optimization of Class of Nonlinear Bilevel Programming Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-14 (2002) - 2000
- [b2]Reiner Horst, Panos M. Pardalos, Nguyen V. Thoai:
Introduction to Global Optimization. Nonconvex Optimization and Its Applications 48, Kluwer 2000, ISBN 978-0-7923-6756-7, pp. 1-316 - [j14]Nguyen V. Thoai:
A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem. Eur. J. Oper. Res. 122(1): 58-68 (2000) - [j13]Marco Locatelli, Nguyen V. Thoai:
Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes. J. Glob. Optim. 18(2): 107-128 (2000) - [j12]Nguyen V. Thoai:
Conical Algorithm in Global Optimization for Optimizing over Efficient Sets. J. Glob. Optim. 18(4): 321-336 (2000)
1990 – 1999
- 1999
- [j11]Reiner Horst, Nguyen V. Thoai:
Maximizing a concave function over the efficient or weakly-efficient set. Eur. J. Oper. Res. 117(2): 239-252 (1999) - 1998
- [j10]Nguyen Van Thoai:
Global Optimization Techniques for Solving the General Quadratic Integer Programming Problem. Comput. Optim. Appl. 10(2): 149-163 (1998) - 1997
- [i11]Reiner Horst, Le Dung Muu, Nguyen V. Thoai:
A Decomposition Algorithm for Optimization over Efficient Sets. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-04 (1997) - [i10]Nguyen V. Thoai:
A Decomposition Method Using Duality Bounds for Nonconvex Optimization. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-24 (1997) - 1996
- [j9]Reiner Horst, Nguyen V. Thoai:
A new algorithm for solving the general quadratic programming problem. Comput. Optim. Appl. 5(1): 39-48 (1996) - [i9]Reiner Horst, Nguyen V. Thoai:
Utility Function Programs and Optimization over the Efficient Set in Multiple Objective Decision Making. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-03 (1996) - [i8]Nguyen V. Thoai:
Utility Function Program with or without Explicit Form of Utility Function. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-45 (1996) - 1994
- [j8]Reiner Horst, Nguyen Van Thoai:
Constraint decomposition algorithms in global optimization. J. Glob. Optim. 5(4): 333-348 (1994) - [j7]Nguyen Van Thoai:
On the construction of test problems for concave minimization algorithms. J. Glob. Optim. 5(4): 399-402 (1994) - [i7]Reiner Horst, M. Nast, Nguyen V. Thoai:
A New LP-Bound in Multivariate Lipschitz Optimization: Application to Unconstrained and Linearly Constrained Problems and to Systems of Inequalities. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-08 (1994) - [i6]Nguyen V. Thoai:
Global Optimization Techniques for Solving the General Quadratic Integer Programming Problem. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-09 (1994) - [i5]Nguyen V. Thoai:
A Decomposition Method in Nonconvex Mixed-Integer Programming. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-10 (1994) - [i4]Reiner Horst, Nguyen V. Thoai:
An Integer Concave Minimization Approach for the Minimum Concave Cost Capacitated Flow Problem on Networks. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-13 (1994) - 1993
- [i3]Reiner Horst, Nguyen V. Thoai:
Constraint Decomposition Algorithms in Global Optimization. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-15 (1993) - [i2]Reiner Horst, Nguyen V. Thoai:
A new Algorithm for Solving the General Quadratic Programming Problem. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-22 (1993) - [i1]Reiner Horst, Nguyen V. Thoai:
A Decomposition Approach for the Global Minimization of Biconcave Functions over Polytopes. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-23 (1993) - 1992
- [j6]Reiner Horst, Nguyen Van Thoai, Jakob de Vries:
A new simplicial cover technique in constrained global optimization. J. Glob. Optim. 2(1): 1-19 (1992) - 1991
- [j5]Reiner Horst, Thai Quynh Phong, Nguyen V. Thoai, Jakob de Vries:
On solving a D.C. programming problem by a sequence of linear programs. J. Glob. Optim. 1(2): 183-203 (1991) - [j4]Nguyen V. Thoai:
A global optimization approach for solving the convex multiplicative programming problem. J. Glob. Optim. 1(4): 341-357 (1991) - [j3]Reiner Horst, Nguyen V. Thoai, Harold P. Benson:
Concave minimization via conical partitions and polyhedral outer approximation. Math. Program. 50: 259-274 (1991)
1980 – 1989
- 1989
- [j2]Reiner Horst, Nguyen V. Thoai:
Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems. Computing 42(2-3): 271-289 (1989) - 1984
- [b1]Nguyen Van Thoai:
Verfahren zur Lösung konkaver Optimierungsaufgaben auf der Basis eines verallgemeinerten Erweiterungsprinzips. Humboldt University of Berlin, Unter den Linden, Germany, 1984 - 1980
- [j1]Nguyen Van Thoai, Hoang Tuy:
Convergent Algorithms for Minimizing a Concave Function. Math. Oper. Res. 5(4): 556-566 (1980)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
