Prof. Dr. Andreas S. Schulz
Academic Career and Research Areas
The research of Andreas S. Schulz centers on the theoretical foundations of mathematical optimization and on solving optimization problems that arise in the context of communication networks, health care delivery, logistics, manufacturing, online advertising, supply chain management, transportation and other complex decision-making situations.
Prof. Schulz currently holds a professorship at the Center for Mathematics and the TUM School of Management. In 1998 he became a faculty member at the Massachusetts Institute of Technology (MIT), most recently as the Patrick J. McGovern Chair of Management and Professor of Mathematics of Operations Research. Previously he was head of the operations research & statistics group at MIT’s Sloan School. He has held visiting positions at the Sauder School of Business of the University of British Columbia, at the Faculty of Economics and Business Administration of Maastricht University, at the Institute of Theoretical Computer Science at ETH Zurich, and at the Department of Mathematics of TU Berlin, from which he obtained his PhD in 1996.
- Alexander von Humboldt Professorship
- Humboldt Research Award
- Glover-Klingman Prize
Key Publications (alle Publikationen)
Dunkel J, Schulz AS: “The Gomory-Chvátal closure of a non-rational polytope is a rational polytope”. Mathematics of Operations Research. 2013; 38(1): 63-91.Abstract
Schulz AS, Telha C: “Approximation algorithms and hardness results for the joint replenishment problem with constant demands”. Lecture Notes in Computer Science. 2011; 6942: 628-639.Abstract
Schulz AS: “On the relative complexity of 15 problems related to 0/1-integer programming”. In: Research trends in combinatorial optimization. Editor: Cook WJ, Lovász L, Vygen J. Berlin: Springer, 2009: 399-428.Abstract
Correa JR, Schulz AS, Stier Moses NE: “A geometric approach to the price of anarchy in nonatomic congestion games”. Games and Economic Behavior. 2008; 64(2): 457-469.Abstract
Möhring RH, Schulz AS, Stork F, Uetz M: “Solving project scheduling problems by minimum cut computations”. Management Science. 2003; 49(3): 330-350.Abstract