Andreas S. Schulz
Nimike
Viittaukset
Viittaukset
Vuosi
Scheduling to minimize average completion time: Off-line and on-line approximation algorithms
LA Hall, AS Schulz, DB Shmoys, J Wein
Mathematics of Operations Research 22, 513-544, 1997
5541997
Selfish routing in capacitated networks
JR Correa, AS Schulz, NE Stier-Moses
Mathematics of Operations Research 29 (4), 961-976, 2004
5002004
Solving project scheduling problems by minimum cut computations
RH Möhring, AS Schulz, F Stork, M Uetz
Management science 49 (3), 330-350, 2003
2692003
System-optimal routing of traffic flows with user constraints in networks with congestion
O Jahn, RH Möhring, AS Schulz, NE Stier-Moses
Operations research 53 (4), 600-616, 2005
2672005
Polyhedral approaches to machine scheduling
M Queyranne, AS Schulz
TU Berlin, Department of Mathematics, 1994
2251994
Approximation in stochastic scheduling: The power of LP-based priority policies
RH Möhring, AS Schulz, M Uetz
Journal of the ACM 46 (6), 924-942, 1999
2051999
Coordination mechanisms for selfish scheduling
N Immorlica, LE Li, VS Mirrokni, AS Schulz
Theoretical computer science 410 (17), 1589-1598, 2009
195*2009
Improved scheduling algorithms for minsum criteria
S Chakrabarti, CA Phillips, AS Schulz, DB Shmoys, C Stein, J Wein
International Colloquium on Automata, Languages, and Programming, 646-657, 1996
1911996
Single machine scheduling with release dates
MX Goemans, M Queyranne, AS Schulz, M Skutella, Y Wang
SIAM Journal on Discrete Mathematics 15, 165-192, 2002
1822002
Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
AS Schulz
International conference on integer programming and combinatorial …, 1996
1731996
On the performance of user equilibria in traffic networks
AS Schulz, NE Stier-Moses
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2003
1602003
Scheduling unrelated machines by randomized rounding
AS Schulz, M Skutella
SIAM Journal on Discrete Mathematics 15 (4), 450-469, 2002
1562002
On the inefficiency of equilibria in congestion games
JR Correa, AS Schulz, NE Stier-Moses
Integer Programming and Combinatorial Optimization, 167-181, 2005
1242005
Revisiting the greedy approach to submodular set function maximization
PR Goundan, AS Schulz
Optimization online, 2007
1212007
A geometric approach to the price of anarchy in nonatomic congestion games
JR Correa, AS Schulz, NE Stier-Moses
Games and Economic Behavior 64 (2), 457-469, 2008
1192008
Fast, fair, and efficient flows in networks
JR Correa, AS Schulz, NE Stier-Moses
Operations Research 55 (2), 215-225, 2007
1062007
Approximate local search in combinatorial optimization
JB Orlin, AP Punnen, AS Schulz
SIAM Journal on Computing 33 (5), 1201-1214, 2004
1032004
On-line scheduling to minimize average completion time revisited
N Megow, AS Schulz
Operations Research Letters 32 (5), 485-490, 2004
942004
Polytopes and scheduling
AS Schulz
PhD thesis, Technische Universität Berlin, 1996
921996
The power of α‐points in preemptive single machine scheduling
AS Schulz, M Skutella
Journal of Scheduling 5 (2), 121-133, 2002
902002
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20