Andreas S. Schulz
Cited by
Cited by
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
Selfish routing in capacitated networks
JR Correa, AS Schulz, NE Stier-Moses
Mathematics of Operations Research 29 (4), 961-976, 2004
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
Solving project scheduling problems by minimum cut computations
RH Möhring, AS Schulz, F Stork, M Uetz
Management science 49 (3), 330-350, 2003
Polyhedral approaches to machine scheduling
M Queyranne, AS Schulz
TU Berlin, Department of Mathematics, 1994
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
Coordination mechanisms for selfish scheduling
N Immorlica, LE Li, VS Mirrokni, AS Schulz
Theoretical computer science 410 (17), 1589-1598, 2009
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
Improved scheduling algorithms for minsum criteria
S Chakrabarti, CA Phillips, AS Schulz, DB Shmoys, C Stein, J Wein
Automata, Languages and Programming: 23rd International Colloquium, ICALP'96 …, 1996
Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
AS Schulz
Integer Programming and Combinatorial Optimization: 5th International IPCO …, 1996
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
Scheduling unrelated machines by randomized rounding
AS Schulz, M Skutella
SIAM Journal on Discrete Mathematics 15 (4), 450-469, 2002
Revisiting the greedy approach to submodular set function maximization
PR Goundan, AS Schulz
Optimization online, 2007
On the inefficiency of equilibria in congestion games
JR Correa, AS Schulz, NE Stier-Moses
Integer Programming and Combinatorial Optimization, 167-181, 2005
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
Approximate local search in combinatorial optimization
JB Orlin, AP Punnen, AS Schulz
SIAM Journal on Computing 33 (5), 1201-1214, 2004
Fast, fair, and efficient flows in networks
JR Correa, AS Schulz, NE Stier-Moses
Operations Research 55 (2), 215-225, 2007
On-line scheduling to minimize average completion time revisited
N Megow, AS Schulz
Operations Research Letters 32 (5), 485-490, 2004
Minimizing the sum of weighted completion times in a concurrent open shop
M Mastrolilli, M Queyranne, AS Schulz, O Svensson, NA Uhan
Operations Research Letters 38 (5), 390-395, 2010
Robust monotone submodular function maximization
JB Orlin, AS Schulz, R Udwani
Mathematical Programming 172, 505-537, 2018
The system can't perform the operation now. Try again later.
Articles 1–20