Daniel R. Schmidt
Title
Cited by
Cited by
Year
On the use of network flow techniques for assigning evacuees to exits
D Dressler, M Groß, JP Kappmeier, T Kelter, J Kulbatzki, D Plümpe, ...
Procedia Engineering 3, 205-215, 2010
362010
On the Cost of Essentially Fair Clusterings
MS Ioana O. Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner ...
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2019
22*2019
Single-commodity robust network design with finite and hose demand sets
V Cacchiani, M Jünger, F Liers, A Lodi, DR Schmidt
Mathematical Programming 157 (1), 297-342, 2016
192016
Approximating earliest arrival flows in arbitrary networks
M Groß, JPW Kappmeier, DR Schmidt, M Schmidt
European Symposium on Algorithms, 551-562, 2012
192012
Single-commodity robust network design problem: Complexity, instances and heuristic solutions
E Álvarez-Miranda, V Cacchiani, A Lodi, T Parriani, DR Schmidt
European Journal of Operational Research 238 (3), 711-723, 2014
112014
Models and algorithms for robust network design with several traffic scenarios
E Álvarez-Miranda, V Cacchiani, T Dorneth, M Jünger, F Liers, A Lodi, ...
International Symposium on Combinatorial Optimization, 261-272, 2012
72012
A Local-Search Algorithm for Steiner Forest
J Matuschke, M Groß, A Gupta, A Kumar, DR Schmidt, M Schmidt, ...
Leibniz International Proceedings in Informatics, 31: 1-31: 17, 2018
6*2018
MIP Formulations for the Steiner Forest Problem
D Schmidt, B Zey, F Margot
arXiv preprint arXiv:1709.01124, 2017
62017
Solving k-means on High-Dimensional Big Data
MS Jan-Philipp W. Kappmeier, Daniel R. Schmidt
Lecture Note in Computer Science, Experimental Algorithms, Proceedings of …, 2015
4*2015
Robust Design of Single-Commodity Networks
DR Schmidt
Universität zu Köln, 2014
22014
Generalized Hose uncertainty in single-commodity robust network design
CE Gounaris, DR Schmidt
Optimization Letters, 1-20, 2019
12019
An Exact Algorithm for the Steiner Forest Problem
DR Schmidt, B Zey, F Margot
26th Annual European Symposium on Algorithms (ESA 2018), 2018
12018
Stronger MIP formulations for the Steiner forest problem
D Schmidt, B Zey, F Margot
Mathematical Programming, 1-35, 2020
2020
A Local-Search Algorithm for Steiner Forest
M Groÿ, A Gupta, A Kumar, J Matuschke, D Schmidt, J Verschae, ...
2011
Kreuzzahlrätsel
M Groß, JP Kappmeier, D Plümpe, M Schmidt
Mitteilungen der Deutschen Mathematiker-Vereinigung 18 (2), 118-118, 2010
2010
Kreuzzahlrätsel: Sudokus waren gestern
M Groß, D Plümpe, M Schmidt
Informatik-Spektrum 32 (6), 538-545, 2009
2009
Kreuzzahlrätsel. Die Seite für Kinder
M Groß, JP Kappmeier, D Plümpe, M Schmidt
Mitteilungen der Deutschen Mathematiker-Vereinigung 17 (2), 96-96, 2009
2009
Evakuierungsprobleme
M Groß, M Kabbash, JP Kappmeier, S Kardung, T Kelter, J Kulbatzki, ...
2009
Towards shortest longest edges in orthogonal graph drawing
M Gronemann, M Jünger, S Mallach, DR Schmidt
The system can't perform the operation now. Try again later.
Articles 1–19