Daniel R. Schmidt

21 papers A 3B 2C 1Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2024 B conf
Local Search k-means++ with Foresight.
SEA
Theo Conrads, Lukas Drexler, Joshua Könen, Daniel R. Schmidt, Melanie Schmidt
2024 J jnl
Local Search k-means++ with Foresight.
CoRR
Theo Conrads, Lukas Drexler, Joshua Könen, Daniel R. Schmidt, Melanie Schmidt
2022 J jnl
Finding all minimum cost flows and a faster algorithm for the K best flow problem.
Discret. Appl. Math.
David Könen, Daniel R. Schmidt, Christiane Spisla
2021 J jnl
Chvátal-Gomory cuts for the Steiner tree problem.
Discret. Appl. Math.
Daniela Gaul, Daniel R. Schmidt
2021 J jnl
Correction to: Stronger MIP formulations for the Steiner forest problem.
Math. Program.
Daniel R. Schmidt, Bernd Zey, François Margot
2021 J jnl
Finding all minimum cost flows and a faster algorithm for the K best flow problem.
CoRR
David Könen, Daniel R. Schmidt, Christiane Spisla
2021 J jnl
Stronger MIP formulations for the Steiner forest problem.
Math. Program.
Daniel R. Schmidt, Bernd Zey, François Margot
2020 J jnl
Generalized Hose uncertainty in single-commodity robust network design.
Optim. Lett.
Chrysanthos E. Gounaris, Daniel R. Schmidt
2019 — conf
On the Cost of Essentially Fair Clusterings.
APPROX-RANDOM
Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt
2018 A conf
A Local-Search Algorithm for Steiner Forest.
ITCS
Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
2018 A conf
An Exact Algorithm for the Steiner Forest Problem.
ESA
Daniel R. Schmidt, Bernd Zey, François Margot
2018 J jnl
On the cost of essentially fair clusterings.
CoRR
Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt
2017 J jnl
A Local-Search Algorithm for Steiner Forest.
CoRR
Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
2017 J jnl
MIP Formulations for the Steiner Forest Problem.
CoRR
Daniel R. Schmidt, Bernd Zey, François Margot
2016 J jnl
Single-commodity robust network design with finite and Hose demand sets.
Math. Program.
Valentina Cacchiani, Michael Jünger, Frauke Liers, Andrea Lodi, Daniel R. Schmidt
2015 B conf
Solving k-means on High-Dimensional Big Data.
SEA
Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt
2015 J jnl
Solving k-means on High-dimensional Big Data.
CoRR
Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt
2014 — —
Robust Design of Single-Commodity Networks
Daniel R. Schmidt
2014 J jnl
Single-commodity robust network design problem: Complexity, instances and heuristic solutions.
Eur. J. Oper. Res.
Eduardo Álvarez-Miranda, Valentina Cacchiani, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt
2012 A conf
Approximating Earliest Arrival Flows in Arbitrary Networks.
ESA
Martin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt
2012 C conf
Models and Algorithms for Robust Network Design with Several Traffic Scenarios.
ISCO
Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt