2026 Andreas S. Schulz: Mathematics Researcher – H-Index, Publications & Awards

D-Index & Metrics

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Mathematics	40	2059	1810	131	118	114	6611
Engineering and Technology	40	7306	7052	248	239	116	6633

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Mathematics

2059

1810

131

118

114

6611

Engineering and Technology

7306

7052

248

239

116

6633

Mathematics

D-Index

Citations

6611

World Ranking

2059

National Ranking

131

Engineering and Technology

D-Index

Citations

6633

World Ranking

7306

National Ranking

248

Overview

Andreas S. Schulz is affiliated with the Technical University of Munich in Germany. Their research spans multiple areas within engineering and computer science, with a primary focus on scheduling and optimization algorithms, as well as computational theory and applied mathematics.

The main fields of study Andreas contributes to include:

Engineering
Computer Science

Their work delves into several subfields, with notable contributions in:

Industrial and Manufacturing Engineering
Computational Theory and Mathematics
Computer Networks and Communications
Electrical and Electronic Engineering
Economics and Econometrics

Specific research topics Andreas has extensively worked on include:

Scheduling and Optimization Algorithms
Optimization and Search Problems
Complexity and Algorithms in Graphs
Graph Theory and CDMA Systems
Advanced Graph Theory Research
Optimization and Packing Problems
Advanced Manufacturing and Logistics Optimization

Andreas S. Schulz has authored several papers in prominent journals and venues. Notable recent publications are:

"Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems," 2022, SIAM Journal on Scientific Computing
"The Competitive Pickup and Delivery Orienteering Problem for Balancing Car-Sharing Systems," 2021, Transportation Science
"Integer Factorization: Why Two-Item Joint Replenishment Is Hard," 2022, Operations Research
"Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover," 2020, arXiv (Cornell University)
"Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses," 2021, Mathematics of Operations Research

Their frequent coauthors include:

Claudio Telha
Felix Happach
Lukas Brandl
Gero Friesecke
Daniela Vögler

Key publication venues where Andreas has contributed multiple works are:

arXiv (Cornell University)
Operations Research Letters
Mathematics of Operations Research
SIAM Journal on Scientific Computing
Transportation Science

Best Publications

Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Leslie A. Hall;Andreas S. Schulz;David B. Shmoys;Joel Wein

728
Citations
Selfish Routing in Capacitated Networks

José R. Correa;Andreas S. Schulz;Nicolás E. Stier-Moses

568
Citations
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion

Olaf Jahn;Rolf H. Möhring;Andreas S. Schulz;Nicolás E. Stier-Moses

327
Citations
Solving Project Scheduling Problems by Minimum Cut Computations

Rolf H. Möhring;Andreas S. Schulz;Frederik Stork;Marc Uetz

290
Citations
Polyhedral Approaches to Machine Scheduling

Maurice Queyranne;Andreas S. Schulz

245
Citations
Approximation in stochastic scheduling: the power of LP-based priority policies

Rolf H. Möhring;Andreas S. Schulz;Marc Uetz

224
Citations
Single Machine Scheduling with Release Dates

Michel X. Goemans;Maurice Queyranne;Andreas S. Schulz;Martin Skutella

201
Citations
Improved Scheduling Algorithms for Minsum Criteria

Soumen Chakrabarti;Cynthia A. Phillips;Andreas S. Schulz;David B. Shmoys

197
Citations
A geometric approach to the price of anarchy in nonatomic congestion games

José R. Correa;Andreas S. Schulz;Nicolás E. Stier-Moses

187
Citations
Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds

Andreas S. Schulz

184
Citations
Scheduling Unrelated Machines by Randomized Rounding

Andreas S. Schulz;Martin Skutella

174
Citations
On the performance of user equilibrium in traffic networks

Andreas S. Schulz;Nicolás Stier Moses

165
Citations
Coordination mechanisms for selfish scheduling

Nicole Immorlica;Li (Erran) Li;Vahab S. Mirrokni;Andreas S. Schulz

140
Citations
On the inefficiency of equilibria in congestion games

José R. Correa;Andreas S. Schulz;Nicolás E. Stier-Moses

135
Citations
Approximate local search in combinatorial optimization

James B. Orlin;Abraham P. Punnen;Andreas S. Schulz

132
Citations
Fast, Fair, and Efficient Flows in Networks

José R. Correa;Andreas S. Schulz;Nicolás E. Stier-Moses

129
Citations
Single-Machine Scheduling with Precedence Constraints

José R. Correa;Andreas S. Schulz

112
Citations
On-line scheduling to minimize average completion time revisited

Nicole Megow;Andreas S Schulz

109
Citations
Robust monotone submodular function maximization

James B. Orlin;Andreas S. Schulz;Rajan Udwani

109
Citations
Minimizing the sum of weighted completion times in a concurrent open shop

Monaldo Mastrolilli;Maurice Queyranne;Andreas S. Schulz;Ola Svensson

99
Citations
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

Alix Munier;Maurice Queyranne;Maurice Queyranne;Andreas S. Schulz

84
Citations
Coordination mechanisms for selfish scheduling

Vahab Mirrokni;Li Li;Nicole Immorlica;Andreas S. Schulz

5
Citations

Frequent Co-Authors

Rolf H. Möhring Technical University of Berlin

Maurice Queyranne University of British Columbia

James B. Orlin MIT

Martin Skutella Technical University of Berlin

David B. Shmoys Cornell University

Dorothea Wagner Karlsruhe Institute of Technology

Sudipta Sengupta Amazon (United States)

Vahab Mirrokni Google (United States)

Li Li Nokia (United States)

William J. Cook University of Waterloo

External Links

Personal website of Andreas S. Schulz Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, there are numerous complementary online degrees and career pathways to explore. Many professionals enhance their quantitative skills by pursuing an data analytics master's degree, which provides advanced training in analyzing complex data sets—a highly sought-after skill in today's job market.

Alternatively, some graduates pivot toward business leadership roles by enrolling in an one year MBA program. These accelerated formats offer a fast track to managerial positions and complement mathematical expertise with essential business acumen.

Flexibility is key for many learners, especially those who bring prior credits to the table. Opting for mba programs that accept transfer credits can save time and reduce costs, making advanced education more accessible.

For those concerned about admission competitiveness, exploring the easy mba programs to get into can be a strategic choice, ensuring continued academic and career progression without lengthy application hurdles.