direkt zum Inhalt springen
direkt zum Hauptnavigationsmenü
Sie sind hier
Suchen
Institut für MathematikFG Kombinatorische Optimierung und Graphenalgorithmen
Sie sind auf Seite:1 | 2
Sortieren nach: Autor Jahr Journal
Schewior, Kevin. Handling Critical Tasks Online. Doctoral thesis, TU Berlin, 2016.
Link zur Publikation
Cseh, Ágnes. Complexity and algorithms in matching problems under preferences. Doctoral thesis, TU Berlin, 2016.
Gellert, Torsten J.. Scheduling Rail-mounted Cranes. Doctoral thesis, TU Berlin, 2015.
Rezapour, Mohsen. Network Design with Facility Location. Doctoral thesis, TU Berlin, 2015.
Kappmeier, J.-P. W.. Generalizations of Flows over Time with Applications in Evacuation Optimization. Doctoral thesis, TU Berlin, 2015.
Groß, Martin. Approximation Algorithms for Complex Network Flow Over Time Problems. Doctoral thesis, TU Berlin, 2014.
Welz, Wolfgang. Robot Tour Planning with High Determination Costs. Doctoral thesis, TU Berlin, 2014.
Goetzmann, Kai-Simon. The Power of Compromise. Reference Point Methods and Approximation in Multicriteria Optimization. Doctoral thesis, TU Berlin, 2013.
Link zur Publikation Link zur Originalpublikation
Matuschke, Jannik. Network flows and network design in theory and practice. Doctoral thesis, TU Berlin, 2013.
Höhn, Wiebke. Complex Single Machine Scheduling: Theoretical and Practical Aspects of Sequencing. Doctoral thesis, TU Berlin, 2013.
Friedrich, Madeleine. Benefits of Sexual Reproduction in Evolutionary Computation. Doctoral thesis, TU Berlin, 2013.
Klimm, Max. Competition for Resources: The Equilibrium Existence Problem in Congestion Games. Doctoral thesis, TU Berlin, 2012.
Verschae, José. The power of recourse in online optimization. Doctoral thesis, TU Berlin, 2012.
Koch, Ronald. Routing Games over Time. Doctoral thesis, TU Berlin, 2012.
Dressler, Daniel. Network Flow Problems Arising From Evacuation Planning. Doctoral thesis, TU Berlin, 2012.
Schulz, Jens. Hybrid Solving Techniques for Resouce-Constrained Project Scheduling. Doctoral thesis, TU Berlin, 2012.
Wiese, Andreas. Packet routing and scheduling. Doctoral thesis, TU Berlin, 2011.
Büsing, Christina. Recoverable Robustness in Combinatorial Optimization. Doctoral thesis, TU Berlin, 2010.
Brenner, Janina. Truthful Mechanism Design for Cooperative Cost Sharing and Congestion Games. Doctoral thesis, TU Berlin, 2010.
Nasrabadi, Ebrahim. Dynamic Flows in Time-varying Networks. Doctoral thesis, Amirkabir University of Technology / TU Berlin, 2009.
Stiller, Sebastian. Extending Concepts of Reliability: Network Creation Games, Real-time Scheduling, and Robust Optimization. Doctoral thesis, TU Berlin, 2009.
König, Felix G.. Sorting with Objectives - Graph Theoretic Concepts in Industrial Optimization. Doctoral thesis, Technische Universität Berlin, 2009. Supervisors: Rolf H. Möhring and Peter Widmayer.
Oellrich, Martin. Minimum Cost Disjoint Paths under Arc Dependences - Algorithms for Practice. Doctoral thesis, TU Berlin, 2008.
Stenzel, Björn. Online Disjoint Vehicle Routing with Application to AGV Routing. Doctoral thesis, TU Berlin, 2008.
Wünsch, Gregor. Coordination of Traffic Signals in Networks and Related Graph Theoretical Problems on Spanning Trees. Doctoral thesis, TU Berlin, 2008.