default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Löhne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Daniel Dörfler
, Andreas Löhne:
Polyhedral Approximation of Spectrahedral Shadows via Homogenization. J. Optim. Theory Appl. 200(2): 874-890 (2024)- 2022
- [j17]Daniel Dörfler, Andreas Löhne, Christopher Schneider, Benjamin Weißing:
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection. Optim. Methods Softw. 37(3): 1006-1026 (2022) - 2020
- [j16]Simeon vom Dahl, Andreas Löhne:
Solving polyhedral d.c. optimization problems via concave minimization. J. Glob. Optim. 78(1): 37-47 (2020) - [j15]Andreas H. Hamel, Andreas Löhne:
Choosing sets: preface to the special issue on set optimization and applications. Math. Methods Oper. Res. 91(1): 1-4 (2020) - [i2]Andreas Löhne:
Approximate Vertex Enumeration. CoRR abs/2007.06325 (2020)
2010 – 2019
- 2019
- [c2]Joachim Giesen, Sören Laue, Andreas Löhne, Christopher Schneider:
Using Benson's Algorithm for Regularization Parameter Tracking. AAAI 2019: 3689-3696 - 2018
- [j14]Daniel Ciripoi, Andreas Löhne, Benjamin Weißing:
A vector linear programming approach for certain global optimization problems. J. Glob. Optim. 72(2): 347-372 (2018) - [j13]Andreas H. Hamel, Andreas Löhne:
A set optimization approach to zero-sum matrix games with multi-dimensional payoffs. Math. Methods Oper. Res. 88(3): 369-397 (2018) - [c1]H. Martin Bücker, Andreas Löhne, Benjamin Weißing, Gerhard W. Zumbusch:
On Parallelizing Benson's Algorithm: - Limits and Opportunities. ICCSA (2) 2018: 653-668 - 2017
- [j12]Andreas Löhne, Benjamin Weißing:
The vector linear program solver Bensolve - notes on theoretical background. Eur. J. Oper. Res. 260(3): 807-813 (2017) - [j11]Andreas Löhne, André Wagner:
Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver. J. Glob. Optim. 69(2): 369-385 (2017) - 2016
- [j10]Andreas Löhne, Benjamin Weißing:
Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming. Math. Methods Oper. Res. 84(2): 411-426 (2016) - 2015
- [j9]Andreas Löhne, Birgit Rudloff:
On the dual of the solvency cone. Discret. Appl. Math. 186: 176-185 (2015) - 2014
- [j8]Andreas H. Hamel, Andreas Löhne, Birgit Rudloff:
Benson type algorithms for linear vector optimization and applications. J. Glob. Optim. 59(4): 811-836 (2014) - [j7]Andreas Löhne, Birgit Rudloff, Firdevs Ulus:
Primal and dual approximation algorithms for convex vector optimization problems. J. Glob. Optim. 60(4): 713-736 (2014) - [j6]Andreas H. Hamel, Andreas Löhne:
Lagrange Duality in Set Optimization. J. Optim. Theory Appl. 161(2): 368-397 (2014) - 2012
- [j5]Matthias Ehrgott, Andreas Löhne, Lizhen Shao:
A dual variant of Benson's "outer approximation algorithm" for multiple objective linear programming. J. Glob. Optim. 52(4): 757-778 (2012) - 2011
- [b1]Andreas Löhne:
Vector Optimization with Infimum and Supremum. Vector Optimization, Springer 2011, ISBN 978-3-642-18350-8, pp. 1-206 - 2010
- [j4]Radu Ioan Bot, Andreas Löhne:
On totally Fenchel unstable functions in finite dimensional spaces. Math. Program. 123(1): 25-31 (2010)
2000 – 2009
- 2009
- [j3]Frank Heyde, Andreas Löhne, Christiane Tammer:
Set-valued duality theory for multiple objective linear programs and application to mathematical finance. Math. Methods Oper. Res. 69(1): 159-179 (2009) - [i1]Matthias Ehrgott, Jussi Hakanen, Hisao Ishibuchi, Andreas Löhne, Mariano Luque, Kaisa Miettinen, Wlodzimierz Ogryczak, Olexandr Romanko, Theodor J. Stewart, Andrzej P. Wierzbicki:
09041 Working Group 4: MCDM and RIMO. Hybrid and Robust Approaches to Multiobjective Optimization 2009 - 2008
- [j2]Frank Heyde, Andreas Löhne:
Geometric Duality in Multiple Objective Linear Programming. SIAM J. Optim. 19(2): 836-845 (2008) - 2007
- [j1]Andreas Löhne:
Ivan Singer: Duality for nonconvex approximation and optimization - Springer, 2006, ISBN 0-387-28394-3. Math. Methods Oper. Res. 66(1): 181-182 (2007)
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 2024-10-07 22:09 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:
