Skutella, Martin 1969-
Skutella, Martin
Skutella, Martin (Mathematician)
Skutella, Martin, 19..-...., mathématicien
Martin Skutella mathématicien allemand
Skutella, Martin (Mathématicien)
VIAF ID: 40219346 (Personal)
Permalink: http://viaf.org/viaf/40219346
Preferred Forms
- 100 0 _ ‡a Martin Skutella ‡c mathématicien allemand
- 100 1 _ ‡a Skutella, Martin
- 100 1 _ ‡a Skutella, Martin ‡c (Mathematician)
-
-
- 100 1 _ ‡a Skutella, Martin ‡d 1969-
- 100 1 _ ‡a Skutella, Martin ‡d 1969-
- 100 1 _ ‡a Skutella, Martin, ‡d 19..-...., ‡c mathématicien
4xx's: Alternate Name Forms (11)
5xx's: Related Names (3)
- 551 _ _ ‡a Freiburg im Breisgau ‡4 ortg ‡4 https://d-nb.info/standards/elementset/gnd#placeOfBirth
- 510 2 _ ‡a Technische Universität Berlin ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Technische Universität Berlin
Works
Title | Sources |
---|---|
Approximation algorithms for the discrete time cost tradeoff problem | |
Computing earliest arrival flows with multiple sources | |
Electronic reproduction/Approximation and online algorithms, c2008: | |
European congress of mathematics : Berlin, 18-22 July, 2016 | |
Fifth international workshop, WAOA 2007 | |
Gems of combinatorial optimization and graph algorithms | |
Integer programming and combinatorial optimization : 18th international conference, IPCO 2016, Liège, Belgium, June 1-3, 2016 : proceedings | |
IPCO 2016 | |
Kraft der rückwirkenden Veränderung in der Online-Optimirung: robuste Lösungen für Scheduling-, Matroide-, und Spannbaum-Problem | |
Length-bounded cuts and flows | |
MATHEON, 2014: | |
Multiline Addressing by Network Flow | |
Network flow problems arising from evacuation planning | |
Netzwerkflussprobleme, welche sich in der Evakuierungsplanung ergeben | |
On the size of weights randomized search heuristics | |
Online scheduling with bounded migration | |
Power of Recourse in Online Optimization: Robust Solutions for Scheduling, Matroid and MST Problems | |
Reachability substitutes for planar digraphs | |
Routing games over time | |
Routingspiele über die Zeit | |
Scheduling LPs bear probabilities randomized approximations for min sum criteria ; (extended abstract) | |
WAOA 2008 |