Daniel R. Schmidt

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 18

Top Topics

Convex Formulation

Top Venues

Discret. Appl. Math.

Publications

Theo Conrads, Lukas Drexler, Joshua Könen, Daniel R. Schmidt, Melanie Schmidt
Local Search k-means++ with Foresight. SEA (2024)
Nathan Nakamura, Paul Szypryt, Amber L. Dagel, Bradley K. Alpert, Douglas A. Bennett, William Bertrand Doriese, Malcolm Durkin, Joseph W. Fowler, Dylan T. Fox, Johnathon D. Gard, Ryan N. Goodner, James Zachariah Harris, Gene C. Hilton, Edward S. Jimenez, Burke L. Kernen, Kurt W. Larson, Zachary H. Levine, Daniel McArthur, Kelsey M. Morgan, Galen C. O'Neil, Nathan J. Ortiz, Christine G. Pappas, Carl D. Reintsema, Daniel R. Schmidt, Peter A. Schultz, Kyle R. Thompson, Joel N. Ullom, Leila Vale, Courtenay T. Vaughan, Christopher Walker, Joel C. Weber, Jason W. Wheeler, Daniel S. Swetz
Nanoscale Three-Dimensional Imaging of Integrated Circuits Using a Scanning Electron Microscope and Transition-Edge Sensor Spectrometer. Sensors 24 (9) (2024)
Theo Conrads, Lukas Drexler, Joshua Könen, Daniel R. Schmidt, Melanie Schmidt
Local Search k-means++ with Foresight. CoRR (2024)
David Könen, Daniel R. Schmidt, Christiane Spisla
Finding all minimum cost flows and a faster algorithm for the K best flow problem. Discret. Appl. Math. 321 (2022)
David Könen, Daniel R. Schmidt, Christiane Spisla
Finding all minimum cost flows and a faster algorithm for the K best flow problem. CoRR (2021)
Daniel R. Schmidt, Bernd Zey, François Margot
Correction to: Stronger MIP formulations for the Steiner forest problem. Math. Program. 188 (1) (2021)
Daniela Gaul, Daniel R. Schmidt
Chvátal-Gomory cuts for the Steiner tree problem. Discret. Appl. Math. 291 (2021)
Daniel R. Schmidt, Bernd Zey, François Margot
Stronger MIP formulations for the Steiner forest problem. Math. Program. 186 (1) (2021)
Chrysanthos E. Gounaris, Daniel R. Schmidt
Generalized Hose uncertainty in single-commodity robust network design. Optim. Lett. 14 (4) (2020)
Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt
On the Cost of Essentially Fair Clusterings. APPROX-RANDOM (2019)
Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
A Local-Search Algorithm for Steiner Forest. ITCS (2018)
Daniel R. Schmidt, Bernd Zey, François Margot
An Exact Algorithm for the Steiner Forest Problem. ESA (2018)
Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt
On the cost of essentially fair clusterings. CoRR (2018)
Daniel R. Schmidt, Bernd Zey, François Margot
MIP Formulations for the Steiner Forest Problem. CoRR (2017)
Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
A Local-Search Algorithm for Steiner Forest. CoRR (2017)
Valentina Cacchiani, Michael Jünger, Frauke Liers, Andrea Lodi, Daniel R. Schmidt
Single-commodity robust network design with finite and Hose demand sets. Math. Program. 157 (1) (2016)
Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt
Solving k-means on High-Dimensional Big Data. SEA (2015)
Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt
Solving k-means on High-dimensional Big Data. CoRR (2015)
Eduardo Álvarez-Miranda, Valentina Cacchiani, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt
Single-commodity robust network design problem: Complexity, instances and heuristic solutions. Eur. J. Oper. Res. 238 (3) (2014)
Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt
Models and Algorithms for Robust Network Design with Several Traffic Scenarios. ISCO (2012)
Martin Groß, Jan-Philipp W. Kappmeier, Daniel R. Schmidt, Melanie Schmidt
Approximating Earliest Arrival Flows in Arbitrary Networks. ESA (2012)