Till Heller

15 papers B 1Journal 8Unranked 5
YearRankTypeTitle / Venue / Authors
2024 J jnl
A unified approach to inverse robust optimization problems.
Math. Methods Oper. Res.
Holger Berthold, Till Heller, Tobias Seidel
2024 J jnl
Algorithms and complexity for the almost equal maximum flow problem.
Networks
Rebekka Haese, Till Heller, Sven O. Krumke
2023 J jnl
p-median location interdiction on trees.
CoRR
Lena Leiß, Till Heller, Luca E. Schäfer, Manuel Streicher, Stefan Ruzika
2022 — conf
A Bicriteria Almost Equal Minimum Cost Flow Model for Day-Ahead Trading.
OR
Elisabeth Finhold, Till Heller, Sven O. Krumke, Neele Leithäuser
2022 — conf
A Heuristic Bicriteria Scheduling Approach for a Flooring Production Planning Problem.
OR
Dominik Leib, Elisabeth Finhold, Till Heller
2022 — conf
Considering Short and Long Term Fairness in Recurrent Auctions with an Application to Collaborative Rostering.
OR
Till Heller, Sebastian Velten
2022 J jnl
On Reward-Penalty-Selection Games.
CoRR
Niklas Gräf, Till Heller, Sven O. Krumke
2021 J jnl
Algorithms and Complexity for the Almost Equal Maximum Flow Problem.
CoRR
Rebekka Haese, Till Heller, Sven O. Krumke
2021 J jnl
Computing the egalitarian allocation with network flows.
CoRR
Till Heller, Sven Oliver Krumke
2021 J jnl
On the Connection between Individual Scaled Vickrey Payments and the Egalitarian Allocation.
CoRR
Niklas Gräf, Till Heller, Sven O. Krumke
2021 — conf
Optimal Trading of Flexible Power Consumption on the Day-Ahead Market.
OR
Neele Leithäuser, Till Heller, Elisabeth Finhold, Florian Schirra
2021 J jnl
The Reward-Penalty-Selection Problem.
CoRR
Till Heller, Sven O. Krumke, Karl-Heinz Küfer
2021 — —
Virtual Prosumer Consortia - A Game Theoretical Optimization Approach.
Till Heller
2020 B conf
2.5-Connectivity: Unique Components, Critical Graphs, and Applications.
WG
Irene Heinrich, Till Heller, Eva Schmidt, Manuel Streicher
2019 — conf
Algorithms and Complexity for the Almost Equal Maximum Flow Problem.
OR
Rebekka Haese, Till Heller, Sven O. Krumke