default search action
Oliver Stein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j63]Oliver Stein:
2023 MMOR best paper award. Math. Methods Oper. Res. 99(1): 1-2 (2024) - [j62]Peter Kirst
, Stefan Schwarze, Oliver Stein
A Branch-and-Bound Algorithm for Nonconvex Nash Equilibrium Problems. SIAM J. Optim. 34(4): 3371-3398 (2024) - 2023
- [j61]Stefan Schwarze, Oliver Stein
A branch-and-prune algorithm for discrete Nash equilibrium problems. Comput. Optim. Appl. 86(2): 491-519 (2023) - [j60]Oliver Stein
Generalized Polarity and Weakest Constraint Qualifications in Multiobjective Optimization. J. Optim. Theory Appl. 198(3): 1156-1190 (2023) - [j59]Oliver Stein:
2022 MMOR best paper award. Math. Methods Oper. Res. 97(2): 159-160 (2023) - [e1]Oliver Grothe, Stefan Nickel, Steffen Rebennack
Operations Research Proceedings 2022: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Karlsruhe, Germany, September 6-9, 2022. Lecture Notes in Operations Research, Springer 2023, ISBN 978-3-031-24906-8 [contents] - [i5]Jan Kaiser
Learning to Do or Learning While Doing: Reinforcement Learning and Bayesian Optimisation for Online Continuous Tuning. CoRR abs/2306.03739 (2023) - 2022
- [j58]Christoph Neumann
Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization. EURO J. Comput. Optim. 10: 100051 (2022) - [j57]Michael Buchholz, Johannes Müller, Martin Herrmann, Jan Strohbeck
Handling Occlusions in Automated Driving Using a Multiaccess Edge Computing Server-Based Environment Model From Infrastructure Sensors. IEEE Intell. Transp. Syst. Mag. 14(3): 106-120 (2022) - [j56]Oliver Stein:
2021 MMOR best paper award. Math. Methods Oper. Res. 95(2): 183-186 (2022) - [c5]Jan Kaiser
Learning-based Optimisation of Particle Accelerators Under Partial Observability Without Real-World Training. ICML 2022: 10575-10585 - 2021
- [j55]Hatim Djelassi, Alexander Mitsos
Recent advances in nonconvex semi-infinite programming: Applications and algorithms. EURO J. Comput. Optim. 9: 100006 (2021) - [j54]Lorenzo Lampariello
Equilibrium selection for multi-portfolio optimization. Eur. J. Oper. Res. 295(1): 363-373 (2021) - [j53]Gabriele Eichfelder
A general branch-and-bound framework for continuous global multiobjective optimization. J. Glob. Optim. 80(1): 195-227 (2021) - [j52]Gabriele Eichfelder
Correction to: A general branch-and-bound framework for continuous global multiobjective optimization. J. Glob. Optim. 80(1): 229 (2021) - [j51]Oliver Stein
2020 MMOR best paper award. Math. Methods Oper. Res. 93(2): 209-211 (2021) - [j50]Christian Füllner
Convergent upper bounds in global minimization with nonlinear equality constraints. Math. Program. 187(1): 617-651 (2021) - [j49]Christoph Neumann
Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts. SIAM J. Optim. 31(3): 2396-2428 (2021) - [c4]Oliver Stein, Stefan Kaufmann, Michael Watzko, Hubert Rehborn, Jonas Paczia:
Learning from drone observations on highways: characteristics of vehicular traffic at an on-ramp. ICCE-Berlin 2021: 1-6 - [i4]Ola Spjuth
Approaches for containerized scientific workflows in cloud environments with applications in life science. F1000Research 10: 513 (2021) - 2020
- [j48]Lorenzo Lampariello
An explicit Tikhonov algorithm for nested variational inequalities. Comput. Optim. Appl. 77(2): 335-350 (2020) - [j47]Christoph Neumann, Oliver Stein
Granularity in Nonlinear Mixed-Integer Optimization. J. Optim. Theory Appl. 184(2): 433-465 (2020) - [j46]Oliver Stein:
2019 MMOR best paper award. Math. Methods Oper. Res. 91(2): 197-198 (2020) - [j45]Oliver Stein
OR for the classroom. Math. Methods Oper. Res. 91(2): 199 (2020) - [c3]Oliver Stein, Ben Blamey
Smart Resource Management for Data Streaming using an Online Bin-packing Strategy. IEEE BigData 2020: 2207-2216 - [i3]Oliver Stein, Ben Blamey, Johan Karlsson, Alan Sabirsh, Ola Spjuth, Andreas Hellander, Salman Toor:
Smart Resource Management for Data Streaming using an Online Bin-packing Strategy. CoRR abs/2001.10865 (2020)
2010 – 2019
- 2019
- [j44]Christoph Neumann, Oliver Stein
A feasible rounding approach for mixed-integer optimization problems. Comput. Optim. Appl. 72(2): 309-337 (2019) - [j43]Peter Kirst
Global optimization of generalized semi-infinite programs using disjunctive programming. J. Glob. Optim. 73(1): 1-25 (2019) - [j42]Lorenzo Lampariello
The Standard Pessimistic Bilevel Problem. SIAM J. Optim. 29(2): 1634-1656 (2019) - 2018
- [j41]Oliver Stein
The noncooperative transportation problem and linear generalized Nash games. Eur. J. Oper. Res. 266(2): 543-553 (2018) - 2017
- [j40]Peter Kirst, Fabian Rigterink
Global optimization of disjunctive programs. J. Glob. Optim. 69(2): 283-307 (2017) - [j39]Oliver Stein
Preface to the special issue on advances in continuous optimization on the occasion of EUROPT 2015. Math. Methods Oper. Res. 85(1): 1-2 (2017) - 2016
- [j38]Peter Kirst, Oliver Stein
Solving Disjunctive Optimization Problems by Generalized Semi-infinite Optimization Techniques. J. Optim. Theory Appl. 169(3): 1079-1109 (2016) - [j37]Oliver Stein
The Cone Condition and Nonsmoothness in Linear Generalized Nash Games. J. Optim. Theory Appl. 170(2): 687-709 (2016) - [j36]Oliver Stein:
Editorial. Math. Methods Oper. Res. 84(1): 1 (2016) - [j35]Oliver Stein
Editorial. Math. Methods Oper. Res. 84(3): 459 (2016) - [j34]Oliver Stein
Error bounds for mixed integer linear optimization problems. Math. Program. 156(1-2): 101-123 (2016) - [j33]Oliver Stein
Error bounds for mixed integer nonlinear optimization problems. Optim. Lett. 10(6): 1153-1168 (2016) - 2015
- [j32]Oliver Stein
Editorial. Math. Methods Oper. Res. 81(1): 1-2 (2015) - [j31]Tomás Bajbar, Oliver Stein
Coercive Polynomials and Their Newton Polytopes. SIAM J. Optim. 25(3): 1542-1570 (2015) - 2014
- [j30]Oliver Stein
On smoothness properties of optimal value functions at the boundary of their domain under complete convexity. Math. Methods Oper. Res. 79(3): 327-352 (2014) - [j29]Nadja Harms, Christian Kanzow, Oliver Stein
Smoothness properties of a regularized gap function for quasi-variational inequalities. Optim. Methods Softw. 29(4): 720-750 (2014) - 2013
- [j28]Moritz Diehl, Boris Houska
A lifting method for generalized semi-infinite programs based on lower level Wolfe duality. Comput. Optim. Appl. 54(1): 189-210 (2013) - [c2]Fabrizio De Santis, Michael Kasper, Stefan Mangard, Georg Sigl, Oliver Stein, Marc Stöttinger
On the Relationship between Correlation Power Analysis and the Stochastic Approach: An ASIC Designer Perspective. INDOCRYPT 2013: 215-226 - 2012
- [j27]Oliver Stein
How to solve a semi-infinite optimization problem. Eur. J. Oper. Res. 223(2): 312-320 (2012) - [j26]Dominik Dorsch, Vladimir Shikhman, Oliver Stein
Mathematical programs with vanishing constraints: critical point theory. J. Glob. Optim. 52(3): 591-605 (2012) - [j25]Axel Dreves
Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems. J. Glob. Optim. 53(4): 587-614 (2012) - [j24]Oliver Stein
Lifting mathematical programs with complementarity constraints. Math. Program. 131(1-2): 71-94 (2012) - [j23]Jan-J. Rückmann, Oliver Stein:
Preface. Math. Program. 136(1): 1-2 (2012) - [j22]Oliver Stein
The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets. Math. Program. 136(1): 183-207 (2012) - [c1]Michael Zohner, Marc Stöttinger
An adaptable, modular, and autonomous side-channel vulnerability evaluator. HOST 2012: 43-48 - 2011
- [j21]Georg Illies, Manfred Lochter, Oliver Stein:
Behördliche Vorgaben zu kryptografischen Algorithmen. Datenschutz und Datensicherheit 35(11): 807-811 (2011) - [j20]Daniel Ralph, Oliver Stein
The C-Index: A New Stability Concept for Quadratic Programs with Complementarity Constraints. Math. Oper. Res. 36(3): 504-526 (2011)
2000 – 2009
- 2009
- [j19]Oliver Stein, Aysun Tezel:
The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity. SIAM J. Optim. 20(2): 1052-1072 (2009) - [r5]Oliver Stein:
Adaptive Convexification in Semi-Infinite Optimization. Encyclopedia of Optimization 2009: 13-19 - [r4]Oliver Stein:
Continuous Reformulations of Discrete-Continuous Optimization Problems. Encyclopedia of Optimization 2009: 493-501 - [r3]Oliver Stein:
Generalized Semi-infinite Programming: Optimality Conditions. Encyclopedia of Optimization 2009: 1227-1233 - [r2]Hubertus Th. Jongen, Jan-J. Rückmann, Oliver Stein:
Parametric Global Optimization: Sensitivity. Encyclopedia of Optimization 2009: 2912-2917 - [r1]Hubertus Th. Jongen, Oliver Stein:
Smoothing Methods for Semi-Infinite Optimization. Encyclopedia of Optimization 2009: 3617-3622 - 2008
- [j18]Oliver Stein, Georg Still, Tamás Terlaky
Editorial. Central Eur. J. Oper. Res. 16(2): 107-109 (2008) - [j17]Oliver Stein, Aysun Tezel:
The semismooth approach for semi-infinite programming under the Reduction Ansatz. J. Glob. Optim. 41(2): 245-266 (2008) - [j16]Hubertus Th. Jongen, Oliver Stein:
Smoothing by mollifiers. Part I: semi-infinite optimization. J. Glob. Optim. 41(3): 319-334 (2008) - [j15]Hubertus Th. Jongen, Oliver Stein:
Smoothing by mollifiers. Part II: nonlinear optimization. J. Glob. Optim. 41(3): 335-350 (2008) - [j14]Harald Günzel, Hubertus Th. Jongen, Oliver Stein:
Generalized Semi-Infinite Programming: on generic local minimizers. J. Glob. Optim. 42(3): 413-421 (2008) - [j13]Sjur Didrik Flåm, Hubertus Th. Jongen, Oliver Stein:
Slopes of shadow prices and Lagrange multipliers. Optim. Lett. 2(2): 143-155 (2008) - [j12]Harald Günzel, Hubertus Th. Jongen, Oliver Stein:
Generalized semi-infinite programming: the Symmetric Reduction Ansatz. Optim. Lett. 2(3): 415-424 (2008) - 2007
- [j11]Harald Günzel, Hubertus Th. Jongen, Oliver Stein:
On the closure of the feasible set in generalized semi-infinite programming. Central Eur. J. Oper. Res. 15(3): 271-280 (2007) - [j10]Christodoulos A. Floudas, Oliver Stein:
The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming. SIAM J. Optim. 18(4): 1187-1208 (2007) - 2004
- [j9]Oliver Stein, Jan Oldenburg, Wolfgang Marquardt
Continuous reformulations of discrete-continuous optimization problems. Comput. Chem. Eng. 28(10): 1951-1966 (2004) - [j8]Luka Neralic
On regular and parametric data envelopment analysis. Math. Methods Oper. Res. 60(1): 15-28 (2004) - 2003
- [j7]Hubertus Th. Jongen, Oliver Stein:
On the Complexity of Equalizing Inequalities. J. Glob. Optim. 27(4): 367-374 (2003) - [j6]Oliver Stein, Georg Still:
Solving Semi-Infinite Optimization Problems with Interior Point Techniques. SIAM J. Control. Optim. 42(3): 769-788 (2003) - 2002
- [j5]Oliver Stein, Georg Still:
On generalized semi-infinite optimization and bilevel optimization. Eur. J. Oper. Res. 142(3): 444-462 (2002) - 2001
- [j4]Jan-J. Rückmann, Oliver Stein:
On Linear and Linearized Generalized Semi-Infinite Optimization Problems. Ann. Oper. Res. 101(1-4): 191-208 (2001) - [j3]Oliver Stein:
First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization. Math. Oper. Res. 26(3): 565-582 (2001)
1990 – 1999
- 1998
- [j2]Hubertus Th. Jongen, Jan-J. Rückmann, Oliver Stein:
Generalized semi-infinite optimization: A first order optimality condition and examples. Math. Program. 83: 145-158 (1998) - 1997
- [j1]Hubertus Th. Jongen, Oliver Stein:
On Generic One-Parametric Semi-Infinite Optimization. SIAM J. Optim. 7(4): 1103-1137 (1997) - 1995
- [i2]Hubertus Th. Jongen, Oliver Stein:
On Generic One-Parametric Semi-Infinite Optimization. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-06 (1995) - [i1]Hubertus Th. Jongen, Jan-J. Rückmann, Oliver Stein:
Generalized Semi-Infinite Optimization: A First Order Optimality Condition and Examples. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-24 (1995)
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-11-07 21:32 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: