Andreas S. Schulz

Massachusetts Institute of Technology (MIT) - Sloan School of Management

E53-361

77 Massachusetts Avenue

Cambridge, MA 02139-4307

United States

SCHOLARLY PAPERS

11

DOWNLOADS
Rank 36,334

SSRN RANKINGS

Top 36,334

in Total Papers Downloads

1,196

CITATIONS

7

Scholarly Papers (11)

1.

Single Machine Scheduling with Precedence Constraints

Mathematics of Operations Research 30, No 4 (2005), pp. 1005--1021.
Number of pages: 18 Posted: 23 Aug 2004 Last Revised: 27 Nov 2014
José Correa and Andreas S. Schulz
University of Chile - Engineering Department and Massachusetts Institute of Technology (MIT) - Sloan School of Management
Downloads 463 (60,597)

Abstract:

Loading...

Sequencing, Scheduling, Approximation Algorithms, LP Relaxations

Approximate Local Search in Combinatorial Optimization

MIT Sloan Working Paper No. 4325-03
Number of pages: 15 Posted: 16 Jul 2003
James B. Orlin, Abraham P. Punnen and Andreas S. Schulz
Massachusetts Institute of Technology (MIT) - Sloan School of Management, University of New Brunswick - Department of Mathematical Sciences and Massachusetts Institute of Technology (MIT) - Sloan School of Management
Downloads 405 (70,646)

Abstract:

Loading...

Local Search, Neighborhood Search, Approximation Algorithms, Computational Complexity, Combinatorial Optimization, 0/1-Integer Programming

Approximate Local Search in Combinatorial Optimization

SIAM Journal on Computing, Vol. 33, No. 5, pp. 1201-1214, 2004
Posted: 29 Jul 2007
James B. Orlin, Abraham P. Punnen and Andreas S. Schulz
Massachusetts Institute of Technology (MIT) - Sloan School of Management, University of New Brunswick - Department of Mathematical Sciences and Massachusetts Institute of Technology (MIT) - Sloan School of Management

Abstract:

Loading...

Local Search, Neighborhood Search, Approximation Algorithms, Computational Complexity, Combinatorial Optimization, 0/1-Integer Programming

3.

Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms

MIT Sloan Working Paper No. 4435-03
Number of pages: 9 Posted: 31 Oct 2003
Nicole Megow and Andreas S. Schulz
Technische Universität Berlin (TU Berlin) - Fakultat II - Mathematik und Naturwissenschaften and Massachusetts Institute of Technology (MIT) - Sloan School of Management
Downloads 164 (180,216)

Abstract:

Loading...

Scheduling, Sequencing, Approximation Algorithms, On-line Algorithms, Competitive Ratio

4.

Encouraging Cooperation in Sharing Supermodular Costs

MIT Sloan Research Paper No. 4697-08
Number of pages: 44 Posted: 11 Sep 2007 Last Revised: 27 Apr 2008
Andreas S. Schulz and Nelson Uhan
Massachusetts Institute of Technology (MIT) - Sloan School of Management and Massachusetts Institute of Technology (MIT) - Operations Research Center
Downloads 96 (270,603)

Abstract:

Loading...

Game Theory, Combinatorial Optimization, Scheduling, Matroids, Submodular Functions, Approximation Algorithms

5.

A Geometric Approach to the Price of Anarchy in Nonatomic Congestion Games

Games and Economic Behavior, Vol. 64, pp. 457-469
Number of pages: 13 Posted: 03 Jun 2007 Last Revised: 29 Aug 2011
José Correa, Andreas S. Schulz and Nicolas E. Stier-Moses
University of Chile - Engineering Department, Massachusetts Institute of Technology (MIT) - Sloan School of Management and Facebook
Downloads 68 (332,589)
Citation 1

Abstract:

Loading...

Noncooperative games, nonatomic games, congestion games, Wardrop equilibrium, price of anarchy

6.

On-Line Scheduling to Minimize Average Completion Time Revisited

Operations Research Letters 32 (2004), 485-490.
Posted: 01 Aug 2007
Nicole Megow and Andreas S. Schulz
Technische Universität Berlin (TU Berlin) - Fakultat II - Mathematik und Naturwissenschaften and Massachusetts Institute of Technology (MIT) - Sloan School of Management

Abstract:

Loading...

Scheduling, Sequencing, Approximation Algorithms, On-line Algorithms, Competitive Ratio

7.

Selfish Routing in Capacitated Networks

Mathematics of Operations Research, Vol. 29, No. 4, pp. 961-976, November 2004
Posted: 20 Aug 2004
José Correa, Andreas S. Schulz and Nicolas E. Stier-Moses
University of Chile - Engineering Department, Massachusetts Institute of Technology (MIT) - Sloan School of Management and Facebook

Abstract:

Loading...

Selfish Routing, Price of Anarchy, Traffic Assignment, System Optimum, Nash Equilibrium, Performance Guarantee, Multicommodity Flow

8.

Efficiency and Fairness of System-Optimal Routing With User Constraints

Networks, Vol. 48, No. 4, pp. 223-234, 2006
Posted: 17 Aug 2004
Andreas S. Schulz and Nicolas E. Stier-Moses
Massachusetts Institute of Technology (MIT) - Sloan School of Management and Facebook

Abstract:

Loading...

Selfish Routing, Price of Anarchy, Computational Game Theory, Multicommodity Flows, Route Guidance, Traffic Assignment

9.

Solving Project Scheduling Problems by Minimum Cut Computations

Management Science Vol. 49, pp. 330-350, 2003
Posted: 12 Aug 2004
Rolf H. Möhring, Andreas S. Schulz, Frederik Stork and Marc Uetz
Technische Universität Berlin (TU Berlin) - Fakultat II - Mathematik und Naturwissenschaften, Massachusetts Institute of Technology (MIT) - Sloan School of Management, ILOG Deutschland GmbH and Maastricht University - Department of Economics

Abstract:

Loading...

Project scheduling, resource-constrained project scheduling, irregular costs, network optimization, linear programming relaxation

10.

System-Optimal Routing of Traffic Flows With User Constraints in Networks With Congestion

Operations Research, 53:4, 600-616, Jul/Aug 2005
Posted: 17 Jun 2004
Info. Park AG, Technische Universität Berlin (TU Berlin) - Fakultat II - Mathematik und Naturwissenschaften, Massachusetts Institute of Technology (MIT) - Sloan School of Management and Facebook

Abstract:

Loading...

networks/graphs, multicommodity, theory, transportation, models, mathematics, combinatorics

11.

Fast, Fair, and Efficient Flows in Networks

Operations Research, Vol. 55, No. 2, pp. 215-225, Spring 2007
Posted: 01 Dec 2003
José Correa, Andreas S. Schulz and Nicolas E. Stier-Moses
University of Chile - Engineering Department, Massachusetts Institute of Technology (MIT) - Sloan School of Management and Facebook

Abstract:

Loading...

System Optimum, User Equilibrium, Selfish Routing, Price of Anarchy, Approximation Algorithms, Multicriteria Optimization, Multicommodity Flows