default search action
Steffen Rebennack
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j31]Pranjal Pragya Verma, Mohammad Reza Hesamzadeh, Steffen Rebennack, Derek W. Bunn, K. Shanti Swarup, Dipti Srinivasan:
Optimal investment by large consumers in an electricity market with generator market power. Comput. Manag. Sci. 21(1): 36 (2024) - [j30]John Alasdair Warwicker
, Steffen Rebennack:
Support vector machines within a bivariate mixed-integer linear programming framework. Expert Syst. Appl. 245: 122998 (2024) - 2023
- [j29]John Alasdair Warwicker
A unified framework for bivariate clustering and regression problems via mixed-integer linear programming. Discret. Appl. Math. 336: 15-36 (2023) - [c3]Issam Abdeldjalil Ikhelef, John Alasdair Warwicker, Steffen Rebennack, Mohand Yazid Saidi, Ken Chen:
Efficient Decomposition-Based Methods for Optimal VNF Placement and Chaining. APNOMS 2023: 89-94 - [e2]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] - 2022
- [j28]John Alasdair Warwicker
A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting. INFORMS J. Comput. 34(2): 1042-1047 (2022) - [j27]Steffen Rebennack
Data-driven stochastic optimization for distributional ambiguity with integrated confidence region. J. Glob. Optim. 84(2): 255-293 (2022) - [j26]Christian Füllner
Non-convex nested Benders decomposition. Math. Program. 196(1): 987-1024 (2022) - 2021
- [j25]Noam Goldberg, Steffen Rebennack
MINLP formulations for continuous piecewise linear function fitting. Comput. Optim. Appl. 79(1): 223-233 (2021) - [j24]Timo Lohmann, Michael R. Bussieck, Lutz Westermann, Steffen Rebennack
High-Performance Prototyping of Decomposition Methods in GAMS. INFORMS J. Comput. 33(1): 34-50 (2021) - [j23]Nathan Sudermann-Merx, Steffen Rebennack
Leveraged least trimmed absolute deviations. OR Spectr. 43(3): 809-834 (2021) - 2020
- [j22]Steffen Rebennack
Piecewise Linear Function Fitting via Mixed-Integer Linear Programming. INFORMS J. Comput. 32(2): 507-530 (2020) - [j21]Steffen Rebennack
Two-stage stochastic minimum s - t cut problems: Formulations, complexity and decomposition algorithms. Networks 75(3): 235-258 (2020)
2010 – 2019
- 2017
- [j20]Gregory Steeger, Steffen Rebennack
Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: An application to the strategic bidding problem. Eur. J. Oper. Res. 257(2): 669-686 (2017) - [j19]Vitaliy Krasko, Steffen Rebennack
Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: Mitigation and emergency evacuation. Eur. J. Oper. Res. 263(1): 265-282 (2017) - [j18]Timo Lohmann, Steffen Rebennack
Tailored Benders Decomposition for a Long-Term Power Expansion Model with Short-Term Demand Response. Manag. Sci. 63(6): 2027-2048 (2017) - 2016
- [j17]Timo Lohmann, Amanda S. Hering, Steffen Rebennack
Spatio-temporal hydro forecasting of multireservoir inflows for hydro-thermal scheduling. Eur. J. Oper. Res. 255(1): 243-258 (2016) - [j16]Steffen Rebennack
Computing tight bounds via piecewise linear functions through the example of circle cutting problems. Math. Methods Oper. Res. 84(1): 3-57 (2016) - [j15]Steffen Rebennack
Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming. Math. Program. 156(1-2): 343-389 (2016) - 2015
- [j14]Stephen M. Frank
Optimal design of mixed AC-DC distribution systems for commercial buildings: A Nonconvex Generalized Benders Decomposition approach. Eur. J. Oper. Res. 242(3): 710-729 (2015) - [j13]Steffen Rebennack
Continuous Piecewise Linear Delta-Approximations for Bivariate and Multivariate Functions. J. Optim. Theory Appl. 167(1): 102-117 (2015) - [j12]Steffen Rebennack
Continuous Piecewise Linear Delta-Approximations for Univariate Functions: Computing Minimal Breakpoint Systems. J. Optim. Theory Appl. 167(2): 617-643 (2015) - 2014
- [j11]Julia Kallrath, Steffen Rebennack
Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges. Eur. J. Oper. Res. 238(1): 374-389 (2014) - [j10]Josef Kallrath, Steffen Rebennack
Cutting ellipses from area-minimizing rectangles. J. Glob. Optim. 59(2-3): 405-437 (2014) - 2013
- [j9]Jennifer Van Dinter, Steffen Rebennack
The unit commitment model with concave emissions costs: a hybrid Benders' Decomposition with nonconvex master problems. Ann. Oper. Res. 210(1): 361-386 (2013) - [j8]Donatella Granata
Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms. Comput. Oper. Res. 40(11): 2689-2702 (2013) - 2012
- [j7]Steffen Rebennack
A tutorial on branch and cut algorithms for the maximum stable set problem. Int. Trans. Oper. Res. 19(1-2): 161-199 (2012) - 2011
- [j6]Steffen Rebennack
Optimal storage design for a multi-product plant: A non-convex MINLP formulation. Comput. Chem. Eng. 35(2): 255-271 (2011) - [j5]Steffen Rebennack
A Branch and Cut solver for the maximum stable set problem. J. Comb. Optim. 21(4): 434-457 (2011) - [e1]Panos M. Pardalos, Steffen Rebennack
Experimental Algorithms - 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings. Lecture Notes in Computer Science 6630, Springer 2011, ISBN 978-3-642-20661-0 [contents] - 2010
- [j4]Steffen Rebennack
Complexity analysis for maximum flow problems with arc reversals. J. Comb. Optim. 19(2): 200-216 (2010) - [c2]Petros Xanthopoulos
A Novel Wavelet Based Algorithm for Spike and Wave Detection in Absence Epilepsy. BIBE 2010: 14-19 - [c1]Panos M. Pardalos, Steffen Rebennack
Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs. SEA 2010: 13-22
2000 – 2009
- 2009
- [j3]Steffen Rebennack
Column enumeration based decomposition techniques for a class of non-convex MINLP problems. J. Glob. Optim. 43(2-3): 277-297 (2009) - [j2]Steffen Rebennack
Bilinear modeling solution approach for fixed charge network flow problems. Optim. Lett. 3(3): 347-355 (2009) - [r2]Steffen Rebennack
Ellipsoid Method. Encyclopedia of Optimization 2009: 890-899 - [r1]Steffen Rebennack
Stable Set Problem: Branch & Cut Algorithms. Encyclopedia of Optimization 2009: 3676-3688 - 2008
- [j1]Josef Kallrath, Panos M. Pardalos, Steffen Rebennack
Preface. Comput. Manag. Sci. 5(4): 287-288 (2008)
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 21:23 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: