Sie sind hier

## S

Schmidt, M. and Skutella, M..
Earliest Arrival Flows in Networks with Multiple Sinks.
Electronic Notes in Discrete Mathematics, Vol. 36, pp. 607–614, 2010. ISCO 2010 – International Symposium on Combinatorial Optimization.

Schulz, A. S..
Polytopes and Scheduling.
Doctoral thesis, TU Berlin, 1996.

Schulz, J..
Hybrid Solving Techniques for Resouce-Constrained Project Scheduling.
Doctoral thesis, TU Berlin, 2012.

Schulz, A. S. and Skutella, M..
Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria.
In Burkard, Rainer and Woeginger, Gerhard J. (ed.)Algorithms – ESA '97, pp. 416–429, Springer, 1997.

Schulz, A. S. and Skutella, M..
Random-based scheduling: New approximations and LP lower bounds.
In Rolim, José D. P. (ed.)Randomization and Approximation Techniques in Computer Science, pp. 119–133, Springer, 1997.

Schulz, A. S. and Skutella, M..
Scheduling Unrelated Machines by Randomized Rounding.
SIAM Journal on Discrete Mathematics, Vol. 15, pp. 450–469, 2002.

Schulz, A. S. and Skutella, M..
The Power of α-Points in Preemptive Single Machine Scheduling.
Journal of Scheduling, Vol. 5, pp. 121–133, 2002.

Sering, L..
A Combinatorial Upper Bound on the Length of Twang Cascades.
In Proceedings of the 33nd European Workshop on Computational Geometry (EuroCG'17), pp. 177 – 180, Malmö, 2017.

Sering, L. and Vargas Koch, L..
Nash Flows Over Time with Spillback.
In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 935–945, 2019.

Sering, L. and Skutella, M..
Multi-Source Multi-Sink Nash Flows Over Time.
In Borndörfer, R. and Storandt, S. (ed.)Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018), OASICS, Vol. 65, pp. 12:1-12:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

Skutella, M..
Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 37-46, 2015.

Skutella, M., Sviridenko, M. and Uetz, M..
Stochastic scheduling on unrelated machines.
In Mayr, E. W. and Portier, N. (ed.)Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science, Leibniz International Proceedings in Informatics, Vol. 25, pp. 639-650, Dagstuhl Publishing, 2014.

Skutella, M., Peis, B. and Wiese, A..
Packet Routing on the Grid.
In Lopez-Ortiz, Alejandro (ed.)Theoretical Informatics, 9th Latin American Symposium, LATIn 2010, Oaxaca, Mexico, Lecture Notes in Computer Science, Springer, Vol. 6034, pp. 120-130, 2010.

Skutella, M..
Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines.
In Bonifaci, Vincenzo and Demetrescu, Camil and Marchetti-Spaccamela, Alberto (ed.)Experimental Algorithms – 12th International Symposium, SEA 2013, pp. 1–3, Springer, 2013.

Skutella, M..
SIAM Journal on Discrete Mathematics, Vol. 30, pp. 327–342, 2016.

Skutella, M., Sviridenko, M. and Uetz, M..
Unrelated Machine Scheduling with Stochastic Processing Times.
Mathematics of Operations Research, Vol. 41, pp. 851–864, 2016.

Skutella, M. and Verschae, J..
Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures.
Mathematics of Operations Research, Vol. 41, pp. 991–1021, 2016.

Skutella, M..
In Schulz, Aandreas S. and Skutella, Martin and Stiller, Sebastian and Wagner, Dorothea (ed.)Gems of Combinatorial Optimization and Graph Algorithms, pp. 125–132, Springer, 2015.

Skutella, K. and Skutella, M..
Minimal aufspannende Bäume – Wenn das Naheliegende das Beste ist....
In Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Karl Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea (ed.)Taschenbuch der Algorithmen, pp. 353–360, Springer, 2008. In German.

Skutella, K. and Skutella, M..
Minimum Spanning Trees – Sometimes Greed Pays Off.
In Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea (ed.)Algorithms Unplugged, chapter 33, pp. 325–331, Springer, 2011.

Skutella, M..
List Scheduling in Order of α-Points on a Single Machine.
In Bampis, Evripidis and Jansen, Klaus and Kenyon, Claire (ed.)Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications, pp. 250–291, Springer, 2006.

Skutella, M..
An Introduction to Network Flows Over Time.
In Cook, William and Lovász, László and Vygen, Jens (ed.)Research Trends in Combinatorial Optimization, pp. 451–482, Springer, 2009.

Skutella, M..
Convex Quadratic Programming Relaxations for Network Scheduling Problems.
In Ne\vset\vril, Jaroslav (ed.)Algorithms – ESA '99, pp. 127–138, Springer, 1999.

Skutella, M..
Approximating the single source unsplittable min-cost flow problem.
Mathematical Programming, Vol. 91, pp. 493–514, 2002.

Skutella, M..
Convex quadratic and semidefinite programming relaxations in scheduling.
Journal of the ACM, Vol. 48, pp. 206–242, 2001.

Skutella, M..
Approximating the single source unsplittable min-cost flow problem.
In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 136–145, Redondo Beach, CA, 2000.

Skutella, M..
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem.
Mathematics of Operations Research, Vol. 23, pp. 909–929, 1998.

Skutella, M..
Semidefinite Relaxations for Parallel Machine Scheduling.
In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pp. 472–481, Palo Alto, CA, 1998.

Skutella, M..
Approximation and randomization in scheduling.
Doctoral thesis, Technische Universität Berlin, Germany, 1998.

Skutella, M..
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem.
In Proceedings of the 8th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 501–508, New Orleans, LA, 1997.

Skutella, M..
Konjugiertenklassen und Harish-Chandra-Serien symplektischer und orthogonaler Gruppen.
Diploma thesis, RWTH Aachen, 1995. In German.

Skutella, M. and Uetz, M..
Stochastic machine scheduling with precedence constraints.
SIAM Journal on Computing, Vol. 34, pp. 788–802, 2005.

Skutella, M. and Uetz, M..
Scheduling precedence-constrained jobs with stochastic processing times on parallel machines.
In Proceedings of the 12th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 589–590, Washington, DC, 2001.

Skutella, M. and Verschae, J..
A Robust PTAS for Machine Covering and Packing.
In de Berg, Mark and Meyer, Ulrich (ed.)Algorithms – ESA '10, pp. 36–47, Springer, 2010.

Skutella, M. and Weber, A..
On the dominant of the s-t-cut polytope.
Mathematical Programming, Vol. 124, pp. 441–454, 2010.

Skutella, M. and Welz, W..
Route Planning for Robot Systems.
In Hu, Bo and Morasch, Karl and Pickl, Stefan and Siegle, Markus (ed.)Operations Research Proceedings 2010, pp. 307–312, Springer, 2011.

Skutella, M. and Woeginger, G. J..
A PTAS for minimizing the total weighted completion time on identical parallel machines.
Mathematics of Operations Research, Vol. 25, pp. 63–75, 2000.

Skutella, M. and Woeginger, G. J..
A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines.
In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 400–407, Atlanta, GA, 1999.

Stenzel, B..
Online Disjoint Vehicle Routing with Application to AGV Routing.
Doctoral thesis, TU Berlin, 2008.

Stiller, S. and Wiese, A..
Increasing speed scheduling and Flow scheduling.
In Algorithms and Computation (ISAAC 2010), pp. 279–290, Springer, 2010.

Stork, F..
Stochastic Resource-Constrained Project Scheduling.
Doctoral thesis, TU Berlin, 2001.

## T

Theile, M..
Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm.
In Proceedings of the Proceedings of Evolutionary Computation in Combinatorial Optimisation (EvoCOP), pp. 145-155, 2009.

## U

Uetz, M..
Algorithms for Deterministic and Stochastic Scheduling.
Doctoral thesis, TU Berlin, 2001.

## V

Verschae, J..
The power of recourse in online optimization.
Doctoral thesis, TU Berlin, 2012.

Verschae, J. and Wiese, A..
On the Configuration-LP for Scheduling on Unrelated Machines.
In Algorithms - ESA '11, Springer, 2011. to appear.
{"extraction_info": {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9367989897727966, "perplexity": 11544.443398456704}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964359037.96/warc/CC-MAIN-20211130141247-20211130171247-00047.warc.gz"}