Reiner Horst

Affiliations:
  • University of Trier, Department of Mathematics, Germany
  • Technische Hochschule Darmstadt, Germany


According to our database1, Reiner Horst authored at least 38 papers between 1974 and 2000.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2000
Introduction to Global Optimization
Nonconvex Optimization and Its Applications 48, Kluwer, ISBN: 978-0-7923-6756-7, 2000

1999
Maximizing a concave function over the efficient or weakly-efficient set.
Eur. J. Oper. Res., 1999

1998
Convergent Outer Approximation Algorithms for Solving Unary Programs.
J. Glob. Optim., 1998

1997
A Decomposition Algorithm for Optimization over Efficient Sets
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

On generalized bisection of n-simplices.
Math. Comput., 1997

1996
Convergent Outer Approximation Algorithms for Solving Unary Problems
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Lagrange-Duality and Partitioning Techniques in Nonconvex Global Optimization
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Utility Function Programs and Optimization over the Efficient Set in Multiple Objective Decision Making
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Linearly Constrained Global Minimization of Functions with Concave Minorants
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Book reviews.
Math. Methods Oper. Res., 1996

A new algorithm for solving the general quadratic programming problem.
Comput. Optim. Appl., 1996

Global optimization - deterministic approaches, 3. Auflage.
Springer, ISBN: 978-3-540-61038-0, 1996

1994
An Integer Concave Minimization Approach for the Minimum Concave Cost Capacitated Flow Problem on Networks
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

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, 1994

Book reviews.
J. Glob. Optim., 1994

Constraint decomposition algorithms in global optimization.
J. Glob. Optim., 1994

1993
A Decomposition Approach for the Global Minimization of Biconcave Functions over Polytopes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

A Branch-and-Bound Decomposition Approach for Solving Quasiconvex-Concave Programs
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1993

7 Mathematical programming - A computational perspective.
Proceedings of the Computational Statistics., 1993

1992
A new simplicial cover technique in constrained global optimization.
J. Glob. Optim., 1992

Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming.
Ann. Oper. Res., 1992

1991
Concave minimization via conical partitions and polyhedral outer approximation.
Math. Program., 1991

On solving a D.C. programming problem by a sequence of linear programs.
J. Glob. Optim., 1991

1990
Book reviews.
ZOR Methods Model. Oper. Res., 1990

The Geometric Complementarity Problem and Transcending Stationarity in Global Optimization.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989
Book review.
ZOR Methods Model. Oper. Res., 1989

Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems.
Computing, 1989

1988
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems.
Math. Program., 1988

1985
Book reviews.
Z. Oper. Research, 1985

1980
Maximale Flüsse in Netzwerken mit Kantengewinnen: Vergleich dreier Algorithmen.
Angew. Inform., 1980

A note on the convergence of an algorithm for nonconvex programming problems.
Math. Program., 1980

1977
Buchbesprechungen.
Math. Methods Oper. Res., 1977

1976
An algorithm for nonconvex programming problems.
Math. Program., 1976

Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen.
Computing, 1976

1975
Devisenarbitrage als Flußprobleme.
Z. Oper. Research, 1975

A New Branch and Bound Approach for Concave Minimization Problems.
Proceedings of the Optimization Techniques: Modeling and Optimization in the Service of Man, Part 2, 1975

1974
Buchbesprechungen.
Z. Oper. Research, 1974

Ein Beitrag zur quasi-konvexen Optimierung in topologischen linearen Räumen.
Z. Oper. Research, 1974


  Loading...