Items where Author or Editor is "Schmidt, Daniel R."

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 8.

Schmidt, Daniel R. and Zey, Bernd and Margot, François (2017) MIP Formulations for the Steiner Forest Problem.
Technical Report , 29 p.

Cacchiani, Valentina and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Schmidt, Daniel R. (2016) Single-commodity robust network design with finite and Hose demand sets.
Published in: Mathematical Programming Vol. 157 (1). pp. 297-342. ISSN 0025-5610

Kappmeier, Jan-Philipp W. and Schmidt, Daniel R. and Schmidt, Melanie (2015) Solving k-means on High-Dimensional Big Data.
Published In: 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings, Lecture Notes in Computer Science. 9125 Springer 2015, pp. 259-270.

Cacchiani, Valentina and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Schmidt, Daniel R. (2014) Single-Commodity Robust Network Design with Finite and Hose Demand Sets.
Technical Report , 32 p.
Submitted

Álvarez-Miranda, Eduardo and Cacchiani, Valentina and Lodi, Andrea and Parriani, Tiziano and Schmidt, Daniel R. (2014) Single-commodity robust network design problem: Complexity, instances and heuristic solutions.
Published in: European Journal of Operational Research Vol. 238 (3). pp. 711-723. ISSN 0377-2217

Groß, Martin and Kappmeier, Jan-Philipp W. and Schmidt, Daniel R. and Schmidt, Melanie (2012) Approximating Earliest Arrival Flows in Arbitrary Networks.
Published In: Algorithms – ESA 2012, Lecture Notes in Computer Science. 7501 Springer 2012, pp. 551-562.

Álvarez-Miranda, Eduardo and Cacchiani, Valentina and Dorneth, Tim and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Parriani, Tiziano and Schmidt, Daniel R. (2012) Models and Algorithms for Robust Network Design with Several Traffic Scenarios.
Published In: Combinatorial Optimization : Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, Lecture notes in computer science. 7422 Springer-Verlag 2012, pp. 261-272.

Gronemann, Martin and Jünger, Michael and Mallach, Sven and Schmidt, Daniel R. (2011) Towards shortest longest edges in orthogonal graph drawing.
Technical Report , 6 p.

This list was generated on Sat Nov 18 06:14:03 2017 CET.