Steffen Rebennack

Affiliations: 
Economics and Business Colorado School of Mines, Golden, CO, United States 
Area:
Operations Research, Theory Economics, Alternative Energy, Environmental Economics
Google:
"Steffen Rebennack"
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Lohmann T, Bussieck MR, Westermann L, et al. (2020) High-Performance Prototyping of Decomposition Methods in GAMS Informs Journal On Computing. 2019
Rebennack S, Krasko V. (2020) Piecewise Linear Function Fitting via Mixed-Integer Linear Programming Informs Journal On Computing. 32: 507-530
Rebennack S, Prokopyev OA, Singh B. (2020) Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms Networks. 75: 235-258
Lohmann T, Rebennack S. (2017) Tailored Benders Decomposition for a Long-Term Power Expansion Model with Short-Term Demand Response Management Science. 63: 2027-2048
Krasko V, Rebennack S. (2017) Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: Mitigation and emergency evacuation European Journal of Operational Research. 263: 265-282
Steeger G, Rebennack S. (2017) Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: An application to the strategic bidding problem European Journal of Operational Research. 257: 669-686
Frank S, Rebennack S. (2016) An introduction to optimal power flow: Theory, formulation, and examples Iie Transactions (Institute of Industrial Engineers). 1-26
McCoy K, Krasko V, Santi P, et al. (2016) Minimizing economic impacts from post-fire debris flows in the western United States Natural Hazards. 1-28
Rebennack S. (2016) Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming Mathematical Programming. 156: 343-389
Rebennack S. (2016) Computing tight bounds via piecewise linear functions through the example of circle cutting problems Mathematical Methods of Operations Research. 84: 3-57
See more...