Andreas S. Schulz

Citat de

	Toate	Din 2019
Referințe bibliografice	6640	1753
h-index	42	24
i10-index	71	44

340

170

255

1996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202454 52 97 87 89 141 149 161 154 212 305 275 227 308 234 247 249 237 314 295 285 263 333 319 319 315 257 259 283

Acces public

Afișați-le pe toate

6 articole

1 articol

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Nicolas E. Stier-MosesCentral Applied Science, MetaAdresă de e-mail confirmată pe gsb.columbia.edu
Jose CorreaUniversidad de ChileAdresă de e-mail confirmată pe uchile.cl
Rolf H. MöhringProfessor für Mathematik, Technische Universität BerlinAdresă de e-mail confirmată pe tu-berlin.de
Maurice QueyranneEmeritus Professor of Operations and Logistics, UBC Sauder School of BusinessAdresă de e-mail confirmată pe sauder.ubc.ca
Marc UetzProfessor of Discrete Mathematics and Mathematical Programming, University of TwenteAdresă de e-mail confirmată pe utwente.nl
Martin SkutellaEinstein Professor of Mathematics and Computer Science, TU BerlinAdresă de e-mail confirmată pe tu-berlin.de
David ShmoysProfessor of Operations Research & Information Engineering and of Computer ScienceAdresă de e-mail confirmată pe cs.cornell.edu
Joel WeinAdresă de e-mail confirmată pe google.com
James B. OrlinProfessor, Massachusetts Institute of TechnologyAdresă de e-mail confirmată pe mit.edu
Nelson A. UhanMathematics Department, United States Naval AcademyAdresă de e-mail confirmată pe usna.edu
Friedrich EisenbrandEPFLAdresă de e-mail confirmată pe epfl.ch
Cynthia PhillipsLaboratory Fellow, Sandia National Laboratories, Albuquerque, NMAdresă de e-mail confirmată pe sandia.gov
Clifford SteinProfessor of IEOR and CS, Columbia UniversityAdresă de e-mail confirmată pe ieor.columbia.edu
Vahab MirrokniGoogle Fellow, VP, Google ResearchAdresă de e-mail confirmată pe google.com
Li Erran LiIEEE Fellow and ACM Fellow, AWS AI, AmazonAdresă de e-mail confirmată pe cs.columbia.edu
Nicole ImmorlicaMicrosoft ResearchAdresă de e-mail confirmată pe microsoft.com
Nicole MegowProfessor of Mathematics and Computer Science, University of BremenAdresă de e-mail confirmată pe uni-bremen.de
Shashi MittalAmazon.com, SeattleAdresă de e-mail confirmată pe alum.mit.edu
Abraham P. PunnenProfessor of Operations Research, Simon Fraser UniversityAdresă de e-mail confirmată pe sfu.ca
Rajan UdwaniUC BerkeleyAdresă de e-mail confirmată pe berkeley.edu

Urmăriți

Andreas S. Schulz

Technische Universität München

Adresă de e-mail confirmată pe tum.de - Pagina de pornire

Algorithmic Game Theory Approximation Algorithms Discrete Optimization Polyhedral Combinatorics Scheduling Theory


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
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	746	1997
Selfish routing in capacitated networks JR Correa, AS Schulz, NE Stier-Moses Mathematics of Operations Research 29 (4), 961-976, 2004	558	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	330	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	292	2003
Polyhedral approaches to machine scheduling M Queyranne, AS Schulz TU Berlin, Department of Mathematics, 1994	254	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	217	1999
Coordination mechanisms for selfish scheduling N Immorlica, LE Li, VS Mirrokni, AS Schulz Theoretical computer science 410 (17), 1589-1598, 2009	216*	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	200	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	198	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	188	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	187	2003
Scheduling unrelated machines by randomized rounding AS Schulz, M Skutella SIAM Journal on Discrete Mathematics 15 (4), 450-469, 2002	179	2002
Revisiting the greedy approach to submodular set function maximization PR Goundan, AS Schulz Optimization online, 2007	139	2007
On the inefficiency of equilibria in congestion games JR Correa, AS Schulz, NE Stier-Moses Integer Programming and Combinatorial Optimization, 167-181, 2005	132	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	131	2008
Fast, fair, and efficient flows in networks JR Correa, AS Schulz, NE Stier-Moses Operations Research 55 (2), 215-225, 2007	117	2007
Approximate local search in combinatorial optimization JB Orlin, AP Punnen, AS Schulz SIAM Journal on Computing 33 (5), 1201-1214, 2004	117	2004
On-line scheduling to minimize average completion time revisited N Megow, AS Schulz Operations Research Letters 32 (5), 485-490, 2004	111	2004
Robust monotone submodular function maximization JB Orlin, AS Schulz, R Udwani Mathematical Programming 172, 505-537, 2018	101	2018
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	101	2010

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori