Andreas S. Schulz 个人学术档案

引用次数

	总计	2019 年至今
引用	6526	1649
h 指数	42	24
i10 指数	71	43

340

170

255

1996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202454 52 97 87 89 141 150 160 154 214 304 275 227 308 236 244 248 237 315 292 286 263 328 323 320 314 257 269 166

开放获取的出版物数量

查看全部

5 篇文章

1 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Nicolas E. Stier-MosesCentral Applied Science, Meta在 gsb.columbia.edu 的电子邮件经过验证
Jose CorreaUniversidad de Chile在 uchile.cl 的电子邮件经过验证
Rolf H. MöhringProfessor für Mathematik, Technische Universität Berlin在 tu-berlin.de 的电子邮件经过验证
Maurice QueyranneEmeritus Professor of Operations and Logistics, UBC Sauder School of Business在 sauder.ubc.ca 的电子邮件经过验证
Marc UetzProfessor of Discrete Mathematics and Mathematical Programming, University of Twente在 utwente.nl 的电子邮件经过验证
Martin SkutellaEinstein Professor of Mathematics and Computer Science, TU Berlin在 tu-berlin.de 的电子邮件经过验证
David ShmoysProfessor of Operations Research & Information Engineering and of Computer Science在 cs.cornell.edu 的电子邮件经过验证
Joel Wein在 google.com 的电子邮件经过验证
James B. OrlinProfessor, Massachusetts Institute of Technology在 mit.edu 的电子邮件经过验证
Nelson A. UhanMathematics Department, United States Naval Academy在 usna.edu 的电子邮件经过验证
Friedrich EisenbrandEPFL在 epfl.ch 的电子邮件经过验证
Vahab MirrokniGoogle Fellow, VP, Google Research在 google.com 的电子邮件经过验证
Li Erran LiIEEE Fellow and ACM Fellow, AWS AI, Amazon在 cs.columbia.edu 的电子邮件经过验证
Nicole ImmorlicaMicrosoft Research在 microsoft.com 的电子邮件经过验证
Cynthia PhillipsLaboratory Fellow, Sandia National Laboratories, Albuquerque, NM在 sandia.gov 的电子邮件经过验证
Clifford SteinProfessor of IEOR and CS, Columbia University在 ieor.columbia.edu 的电子邮件经过验证
Shashi MittalAmazon.com, Seattle在 alum.mit.edu 的电子邮件经过验证
Abraham P. PunnenProfessor of Operations Research, Simon Fraser University在 sfu.ca 的电子邮件经过验证
Nicole MegowProfessor of Mathematics and Computer Science, University of Bremen在 uni-bremen.de 的电子邮件经过验证
Rajan UdwaniUC Berkeley在 berkeley.edu 的电子邮件经过验证

关注

Andreas S. Schulz

Technische Universität München

在 tum.de 的电子邮件经过验证 - 首页

Algorithmic Game Theory Approximation Algorithms Discrete Optimization Polyhedral Combinatorics Scheduling Theory


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	737	1997
Selfish routing in capacitated networks JR Correa, AS Schulz, NE Stier-Moses Mathematics of Operations Research 29 (4), 961-976, 2004	550	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	325	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	288	2003
Polyhedral approaches to machine scheduling M Queyranne, AS Schulz TU Berlin, Department of Mathematics, 1994	250	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	216	1999
Coordination mechanisms for selfish scheduling N Immorlica, LE Li, VS Mirrokni, AS Schulz Theoretical computer science 410 (17), 1589-1598, 2009	215*	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	197	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	193	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	186	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	184	2003
Scheduling unrelated machines by randomized rounding AS Schulz, M Skutella SIAM Journal on Discrete Mathematics 15 (4), 450-469, 2002	173	2002
Revisiting the greedy approach to submodular set function maximization PR Goundan, AS Schulz Optimization online, 2007	137	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	129	2008
Approximate local search in combinatorial optimization JB Orlin, AP Punnen, AS Schulz SIAM Journal on Computing 33 (5), 1201-1214, 2004	116	2004
Fast, fair, and efficient flows in networks JR Correa, AS Schulz, NE Stier-Moses Operations Research 55 (2), 215-225, 2007	115	2007
On-line scheduling to minimize average completion time revisited N Megow, AS Schulz Operations Research Letters 32 (5), 485-490, 2004	110	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	99	2010
Robust monotone submodular function maximization JB Orlin, AS Schulz, R Udwani Mathematical Programming 172, 505-537, 2018	97	2018

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用