Daniel R. Schmidt

According to our database, Daniel R. Schmidt authored at least 16 papers between 2009 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Finding all minimum cost flows and a faster algorithm for the K best flow problem.

David Könen, Daniel R. Schmidt, Christiane Spisla

Discret. Appl. Math., 2022

2021

Correction to: Stronger MIP formulations for the Steiner forest problem.

Daniel R. Schmidt, Bernd Zey, François Margot

Math. Program., 2021

Stronger MIP formulations for the Steiner forest problem.

Daniel R. Schmidt, Bernd Zey, François Margot

Math. Program., 2021

Chvátal-Gomory cuts for the Steiner tree problem.

Daniela Gaul, Daniel R. Schmidt

Discret. Appl. Math., 2021

2020

Generalized Hose uncertainty in single-commodity robust network design.

Chrysanthos E. Gounaris, Daniel R. Schmidt

Optim. Lett., 2020

2019

On the Cost of Essentially Fair Clusterings.

Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt

Proceedings of the Approximation, 2019

2018

A Local-Search Algorithm for Steiner Forest.

Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

An Exact Algorithm for the Steiner Forest Problem.

Daniel R. Schmidt, Bernd Zey, François Margot

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

MIP Formulations for the Steiner Forest Problem.

Daniel R. Schmidt, Bernd Zey, François Margot

CoRR, 2017

2016

Single-commodity robust network design with finite and Hose demand sets.

Valentina Cacchiani, Michael Jünger, Frauke Liers, Andrea Lodi, Daniel R. Schmidt

Math. Program., 2016

2015

Solving k-means on High-Dimensional Big Data.

Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014

Robust Design of Single-Commodity Networks

Daniel R. Schmidt

PhD thesis, 2014

Single-commodity robust network design problem: Complexity, instances and heuristic solutions.

Eduardo Álvarez-Miranda, Valentina Cacchiani, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt

Eur. J. Oper. Res., 2014

2012

Models and Algorithms for Robust Network Design with Several Traffic Scenarios.

Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Approximating Earliest Arrival Flows in Arbitrary Networks.

Martin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt

Proceedings of the Algorithms - ESA 2012, 2012

2009

Kreuzzahlrätsel: Sudokus waren gestern.

Martin Groß, Daniel Plümpe, Melanie Schmidt

Inform. Spektrum, 2009