Steffen Rebennack

According to our database1, Steffen Rebennack authored at least 26 papers between 2008 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 




Two-stage stochastic minimum s - t cut problems: Formulations, complexity and decomposition algorithms.
Networks, 2020

Piecewise Linear Function Fitting via Mixed-Integer Linear Programming.
INFORMS J. Comput., 2020

Tailored Benders Decomposition for a Long-Term Power Expansion Model with Short-Term Demand Response.
Manag. Sci., 2017

Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: An application to the strategic bidding problem.
Eur. J. Oper. Res., 2017

Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: Mitigation and emergency evacuation.
Eur. J. Oper. Res., 2017

Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming.
Math. Program., 2016

Computing tight bounds via piecewise linear functions through the example of circle cutting problems.
Math. Methods Oper. Res., 2016

Spatio-temporal hydro forecasting of multireservoir inflows for hydro-thermal scheduling.
Eur. J. Oper. Res., 2016

Continuous Piecewise Linear Delta-Approximations for Univariate Functions: Computing Minimal Breakpoint Systems.
J. Optim. Theory Appl., 2015

Continuous Piecewise Linear Delta-Approximations for Bivariate and Multivariate Functions.
J. Optim. Theory Appl., 2015

Optimal design of mixed AC-DC distribution systems for commercial buildings: A Nonconvex Generalized Benders Decomposition approach.
Eur. J. Oper. Res., 2015

Cutting ellipses from area-minimizing rectangles.
J. Glob. Optim., 2014

Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges.
Eur. J. Oper. Res., 2014

Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms.
Comput. Oper. Res., 2013

The unit commitment model with concave emissions costs: a hybrid Benders' Decomposition with nonconvex master problems.
Ann. Oper. Res., 2013

A tutorial on branch and cut algorithms for the maximum stable set problem.
Int. Trans. Oper. Res., 2012

A Branch and Cut solver for the maximum stable set problem.
J. Comb. Optim., 2011

Optimal storage design for a multi-product plant: A non-convex MINLP formulation.
Comput. Chem. Eng., 2011

Complexity analysis for maximum flow problems with arc reversals.
J. Comb. Optim., 2010

Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

A Novel Wavelet Based Algorithm for Spike and Wave Detection in Absence Epilepsy.
Proceedings of the 10th IEEE International Conference on Bioinformatics and Bioengineering, 2010

Stable Set Problem: Branch & Cut Algorithms.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Ellipsoid Method.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Bilinear modeling solution approach for fixed charge network flow problems.
Optim. Lett., 2009

Column enumeration based decomposition techniques for a class of non-convex MINLP problems.
J. Glob. Optim., 2009

Comput. Manag. Sci., 2008