default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReiner Horst
Person information
- affiliation: University of Trier, Department of Mathematics, Germany
- affiliation: Technische Hochschule Darmstadt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 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
1990 – 1999
- 1999
- [j25]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
- [j24]Reiner Horst, Ulrich Raber:
Convergent Outer Approximation Algorithms for Solving Unary Programs. J. Glob. Optim. 13(2): 123-149 (1998) - 1997
- [j23]Reiner Horst:
Book Review. J. Glob. Optim. 11(2): 221-223 (1997) - [j22]Reiner Horst:
On generalized bisection of n-simplices. Math. Comput. 66(218): 691-698 (1997) - [i12]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) - 1996
- [b1]Reiner Horst, Hoang Tuy:
Global optimization - deterministic approaches, 3. Auflage. Springer 1996, ISBN 978-3-540-61038-0, pp. I-XVIII, 1-727 - [j21]Reiner Horst, Nguyen V. Thoai:
A new algorithm for solving the general quadratic programming problem. Comput. Optim. Appl. 5(1): 39-48 (1996) - [j20]Reiner Horst, Karl Heinz Borgwardt:
Book reviews. Math. Methods Oper. Res. 44(2): 291-293 (1996) - [i11]Reiner Horst, M. Nast:
Linearly Constrained Global Minimization of Functions with Concave Minorants. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-01 (1996) - [i10]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) - [i9]Reiner Horst:
On Generalized Bisection of N-Simplices. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-06 (1996) - [i8]Mirjam Dür, Reiner Horst:
Lagrange-Duality and Partitioning Techniques in Nonconvex Global Optimization. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-38 (1996) - [i7]Reiner Horst, Ulrich Raber:
Convergent Outer Approximation Algorithms for Solving Unary Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-39 (1996) - 1994
- [j19]Michael M. Kostreva, Reiner Horst:
Book reviews. J. Glob. Optim. 5(1): 97-99 (1994) - [j18]Reiner Horst, Nguyen Van Thoai:
Constraint decomposition algorithms in global optimization. J. Glob. Optim. 5(4): 333-348 (1994) - [i6]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) - [i5]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
- [p1]William W. Hager, Reiner Horst, Panos M. Pardalos:
7 Mathematical programming - A computational perspective. Computational Statistics 1993: 201-278 - [i4]Reiner Horst, Le Dung Muu, M. Nast:
A Branch-and-Bound Decomposition Approach for Solving Quasiconvex-Concave Programs. Universität Trier, Mathematik/Informatik, Forschungsbericht 93-11 (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
- [j17]Faiz A. Al-Khayyal, Reiner Horst, Panos M. Pardalos:
Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming. Ann. Oper. Res. 34: 125-147 (1992) - [j16]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
- [j15]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) - [j14]Reiner Horst, Nguyen V. Thoai, Harold P. Benson:
Concave minimization via conical partitions and polyhedral outer approximation. Math. Program. 50: 259-274 (1991) - 1990
- [j13]Reiner Horst, Thomas Kämpke, Franz Josef Radermacher:
Book reviews. ZOR Methods Model. Oper. Res. 34(2): 157-160 (1990) - [c2]Reiner Horst, Hoang Tuy:
The Geometric Complementarity Problem and Transcending Stationarity in Global Optimization. Applied Geometry And Discrete Mathematics 1990: 341-354
1980 – 1989
- 1989
- [j12]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) - [j11]Reiner Horst:
Book review. ZOR Methods Model. Oper. Res. 33(1): 38 (1989) - 1988
- [j10]Hoang Tuy, Reiner Horst:
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems. Math. Program. 41(1-3): 161-183 (1988) - 1985
- [j9]Reiner Horst:
Book reviews. Z. Oper. Research 29(7): 314 (1985) - 1980
- [j8]Reiner Horst:
A note on the convergence of an algorithm for nonconvex programming problems. Math. Program. 19(1): 237-238 (1980) - [j7]Reiner Horst:
Maximale Flüsse in Netzwerken mit Kantengewinnen: Vergleich dreier Algorithmen. Angew. Inform. 22(3): 116-118 (1980)
1970 – 1979
- 1977
- [j6]Joachim Gwinner, H. Läpple, Christoph Schneeweiss, Hans G. Bartels, Egon F. Kasper, Karl-Heinz Waldmann, Reiner Horst, R. Hebel, Helmuth Späth:
Buchbesprechungen. Math. Methods Oper. Res. 21(4): B159-B164 (1977) - 1976
- [j5]Reiner Horst:
Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen. Computing 17(2): 121-127 (1976) - [j4]Reiner Horst:
An algorithm for nonconvex programming problems. Math. Program. 10(1): 312-321 (1976) - 1975
- [j3]Reiner Horst:
Devisenarbitrage als Flußprobleme. Z. Oper. Research 19(3): 73-87 (1975) - [c1]Reiner Horst:
A New Branch and Bound Approach for Concave Minimization Problems. Optimization Techniques 1975: 330-336 - 1974
- [j2]Reiner Horst:
Ein Beitrag zur quasi-konvexen Optimierung in topologischen linearen Räumen. Z. Oper. Research 18(1): 19-26 (1974) - [j1]Bernhard Korte, O. Müller, B. Machost, Heiner Müller-Merbach, Reiner Horst, T. Talmon, Herbert Kargl, R. Koxholt, Tomas Gal, Dietrich Ohse, H. Läpple, Wolfgang Bühler, Bernd Schiemenz, G. Trenkler, Peter Kall, Hans M. Dathe:
Buchbesprechungen. Z. Oper. Research 18(5): 226-236 (1974)
Coauthor Index
aka: Nguyen Van Thoai
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 2024-04-25 05:51 CEST 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:
