|
|
Home | Preprints | Journal
Articles | Conference Articles | Miscellaneous | Edited
Volumes | Thesis
Preprints
A.S. Schulz, On the Relative Complexity of 15 Problems Related
to 0/1-Integer Programming, to appear in W.J. Cook, L. Lovász,
J. Vygen (eds.): Research Trends in Combinatorial Optimization,
Springer, Berlin, 2009. [preprint]
|
A.S. Schulz, N.A. Uhan, Near-Optimal Solutions and
Integrality Gaps for Almost All Instances of Precedence-Constrained
Single-Machine Scheduling, last revised August 2008. [preprint]
|
P.R. Goundan, A.S. Schulz, Revisiting the Greedy Approach
to Submodular Set Function Maximization, July 2007, revised
August 2008. [preprint]
|
C.A. Meyers, A.S. Schulz, Integer Equal Flows, August
2008. [preprint]
|
C.A. Meyers, A.S. Schulz, The Complexity of Congestion Games,
June 2008. [preprint]
|
A.S. Schulz, N. Uhan, Encouraging Cooperation in Sharing
Supermodular Costs, August 2007, revised April 2008. [preprints]
|
E.L. Lawler, M. Queyranne, A.S. Schulz, D.B. Shmoys, Weighted
Sum of Completion Times, to appear in E.L. Lawler, J.K. Lenstra,
A.H.G. Rinnooy Kan, D.B. Shmoys (eds.): Scheduling, MPS/SIAM Series on
Optimization; last revised November 2006. [preprint]
|
M. Queyranne, A.S. Schulz, Polyhedral Approaches to
Machine Scheduling, November 1994, last revised September 2004. [preprint]
|
Journal Articles
N. Immorlica, L. Li, V.S. Mirrokni, A.S. Schulz,
Coordination Mechanisms for Selfish Scheduling, Theoretical
Computer Science, to appear. [preprint]
|
J. Dunkel, A.S. Schulz, On the Complexity of
Pure-Strategy Nash Equilibria in Congestion and Local-Effect
Games, Mathematics of Operations Research, to appear. [preprint]
|
J.R. Correa, A.S. Schulz, N.E. Stier Moses, A Geometric
Approach to the Price of Anarchy in Nonatomic Congestion Games,
Games and Economic Behavior, in press. [article]
|
J.B. Orlin, A.S. Schulz, S. Sengupta, ε-Optimization
Schemes and L-Bit Precision: Alternative Perspectives in Combinatorial
Optimization, Discrete Optimization 5 (2008), 550-561. [article]
|
J.R. Correa, A.S. Schulz, N.E. Stier Moses, Fast, Fair,
and Efficient Flows in Networks, Operations Research 55 (2007),
215-225. [article]
|
A.S. Schulz, N.E. Stier Moses, Efficiency and Fairness of
System-Optimal Routing with User Constraints, Networks 48 (2006),
223-234. [article]
|
M. Queyranne, A.S. Schulz, Approximation Bounds for a
General Class of Precedence Constrained Parallel Machine Scheduling
Problems, SIAM Journal on Computing 35 (2006), 1241-1253. [article]
|
J.R. Correa, A.S. Schulz, Single-Machine Scheduling with
Precedence Constraints, Mathematics of Operations Research 30
(2005), 1005-1021. [article]
|
O. Jahn, R.H. Möhring, A.S. Schulz, N.E. Stier Moses,
System-Optimal Routing of Traffic Flows with User Constraints in
Networks with Congestion, Operations Research 53 (2005), 600-616.
[article]
|
J.R. Correa, A.S. Schulz, N.E. Stier Moses, Selfish
Routing in Capacitated Networks, Mathematics of Operations
Research 29 (2004), 961-976. [article]
|
J.B. Orlin, A.P. Punnen, A.S. Schulz, Approximate Local
Search in Combinatorial Optimization, SIAM Journal on Computing
33 (2004), 1201-1214. [article]
|
N. Megow, A.S. Schulz, On-Line Scheduling to Minimize
Average Completion Time Revisited, Operations Research Letters 32
(2004), 485-490. [article]
|
F. Eisenbrand, A.S. Schulz, Bounds on the Chvátal
Rank of Polytopes in the 0/1-Cube, Combinatorica 23 (2003),
245-261. [article]
|
R.H. Möhring, A.S. Schulz, F. Stork, M. Uetz, Solving
Project Scheduling Problems by Minimum Cut Computations,
Management Science 49 (2003), 330-350. [article]
|
A.S. Schulz, R. Weismantel, The Complexity of Generic
Primal Algorithms for Solving General Integer Programs,
Mathematics of Operations Research 27 (2002), 681-692. [article]
|
R. Müller, A.S. Schulz, Transitive Packing: A
Unifying Concept in Combinatorial Optimization, SIAM Journal on
Optimization 13 (2002), 335-367. [article]
|
A.S. Schulz, M. Skutella, Scheduling Unrelated Machines by
Randomized Rounding, SIAM Journal on Discrete Mathematics 15
(2002), 450-469. [article]
|
A.S. Schulz, M. Skutella, The Power of α-Points in
Preemptive Single Machine Scheduling, Journal of Scheduling 5
(2002), 121-133. [article]
|
M.X. Goemans, M. Queyranne, A.S. Schulz, M. Skutella, Y. Wang,
Single Machine Scheduling with Release Dates, SIAM Journal on
Discrete Mathematics 15 (2002), 165-192. [article]
|
R.H. Möhring, A.S. Schulz, F. Stork, M. Uetz, On
Project Scheduling with Irregular Starting Time Costs, Operations
Research Letters 28 (2001), 149-154. [article]
|
R.H. Möhring, A.S. Schulz, M. Uetz, Approximation in
Stochastic Scheduling: The Power of LP-Based Priority Policies,
Journal of the ACM 46 (1999), 924-942. [article]
|
A. Bockmayr, F. Eisenbrand, M. Hartmann, A.S. Schulz, On
the Chvátal Rank of Polytopes in the 0/1 Cube, Discrete
Applied Mathematics 98 (1999), 21-27. [article]
|
S. Hartmann, M.W. Schäffter, A.S. Schulz, Switchbox
Routing in VLSI Design: Closing the Complexity Gap, Theoretical
Computer Science 203 (1998), 31-49. [article]
|
R. Schrader, A.S. Schulz, G. Wambach, Base Polytopes of
Series-Parallel Posets: Linear Description and Optimization,
Mathematical Programming 82 (1998), 159-173.
[article]
|
C.A. Phillips, A.S. Schulz, D.B. Shmoys, C. Stein, J. Wein, Improved Bounds on Relaxations of a Parallel Machine Scheduling
Problem, Journal of Combinatorial Optimization 1 (1998), 413-426.
[article]
|
L.A. Hall, A.S. Schulz, D.B. Shmoys, J. Wein, Scheduling
to Minimize Average Completion Time: Off-Line and On-Line
Approximation Algorithms, Mathematics of Operations Research 22
(1997), 513-544. [article]
|
A. von Arnim, A.S. Schulz, Facets of the Generalized
Permutahedron of a Poset, Discrete Applied Mathematics 72 (1997),
179-192. [article]
|
A.S. Schulz, The Permutahedron of Series-Parallel
Posets, Discrete Applied Mathematics 57 (1995), 85-90. [article]
|
Articles in Refereed Conference Proceedings
S. Mittal, A.S. Schulz, A General Framework for Designing
Approximation Schemes for Combinatorial Optimization Problems with
Many Objectives Combined into One, APPROX 2008. [paper]
|
A.S. Schulz, Stochastic Online Scheduling Revisited, COCOA
2008. [paper]
|
A.S. Schulz, N.A. Uhan, Encouraging Cooperation in Sharing
Supermodular Costs, APPROX 2007. [article]
|
J. Dunkel, A.S. Schulz, On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games, WINE 2006. [article]
|
N. Immorlica, L. Li, V.S. Mirrokni, A.S. Schulz,
Coordination Mechanisms for Selfish Scheduling, WINE 2005. [article]
|
J.R. Correa, A.S. Schulz, N.E. Stier Moses, On the
Inefficiency of Equilibria in Congestion Games, IPCO XI, 2005. [article]
|
J.R. Correa, A.S. Schulz, N.E. Stier Moses, Computational
Complexity, Fairness, and the Price of Anarchy of the Maximum Latency
Problem, IPCO X, 2004. [article]
|
J.R. Correa, A.S. Schulz, Single Machine Scheduling with
Precedence Constraints, IPCO X, 2004. [article]
|
J.B. Orlin, A.P. Punnen, A.S. Schulz, Approximate Local Search
in Combinatorial Optimization, SODA 2004. [article]
|
N. Megow, A.S. Schulz, Scheduling to Minimize Average
Completion Time Revisited: Deterministic On-Line Algorithms, WAOA
2003. [article]
|
A.S. Schulz, N.E. Stier Moses, On the Performance of User
Equilibria in Traffic Networks, SODA 2003. [article]
|
J.B. Orlin, A.S. Schulz, S. Sengupta, ε-Optimization
Schemes and L-Bit Precision: Alternative Perspectives in Combinatorial
Optimization, STOC 2000. [article]
|
O. Jahn, R.H. Möhring, A.S. Schulz, Optimal Routing of
Traffic Flows with Length Restrictions in Networks with Congestion, SOR
1999. [volume]
|
R.H. Möhring, A.S. Schulz, M. Uetz, Stochastic Machine
Scheduling: Performance Guarantees for LP-Based Priority Policies,
APPROX 1999. [article]
|
R.H. Möhring, A.S. Schulz, F. Stork, M. Uetz,
Resource-Constrained Project Scheduling: Computing Lower Bounds by
Solving Minimum Cut Problems, ESA 1999. [article]
|
F. Eisenbrand, A.S. Schulz, Bounds on the Chvátal Rank
of Polytopes in the 0/1-Cube, IPCO VII, 1999. [article]
|
A.S. Schulz, R. Weismantel, An Oracle-Polynomial Time
Augmentation Algorithm for Integer Programming, SODA 1999. [article]
|
R.H. Möhring, M. Oellrich, A.S. Schulz, Exact Algorithms
for the Minimum-Cost Embeddings of Reliable Virtual Private Networks
into Telecommunication Networks, OR 1998. [volume]
|
A. Munier, M. Queyranne, A.S. Schulz, Approximation Bounds for
a General Class of Precedence Constrained Parallel Machine Scheduling
Problems, IPCO VI, 1998. [article]
|
A.S. Schulz, M. Skutella, Scheduling-LPs Bear Probabilities:
Randomized Approximations for Min-Sum Criteria, ESA 1997. [article]
|
A.S. Schulz, M. Skutella, Random-Based Scheduling: New
Approximations and LP Lower Bounds, RANDOM 1997. [article]
|
S. Hartmann, M.W. Schäffter, A.S. Schulz, Switchbox
Routing in VLSI Design: Closing the Complexity Gap, WG 1996. [article]
|
R.H. Möhring, M.W. Schäffter, A.S. Schulz,
Scheduling Jobs with Communication Delays: Using Infeasible Solutions
for Approximation, ESA 1996. [article]
|
S. Chakrabarti, C.A. Phillips, A.S. Schulz, D.B. Shmoys,
C. Stein, J. Wein, Improved Scheduling Algorithms for Minsum Criteria,
ICALP 1996. [article]
|
R. Müller, A.S. Schulz, Transitive Packing, IPCO V,
1996. [article]
|
A.S. Schulz, Scheduling to Minimize Total Weighted Completion
Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds,
IPCO V, 1996. [article]
|
A.S. Schulz, R. Weismantel, G.M. Ziegler, 0/1-Integer
Programming: Optimization and Augmentation are Equivalent, ESA
1995. [article]
|
M. Queyranne, A.S. Schulz, Scheduling Unit Jobs with
Compatible Release Dates on Parallel Machines with Nonstationary
Speeds, IPCO IV, 1995. [article]
|
R. Müller, A.S. Schulz, The Interval Order Polytope of a
Digraph, IPCO IV, 1995. [article]
|
Miscellaneous
R.H. Möhring, A.S. Schulz, M. Uetz, Contribution to the
discussion of the paper "The Achievable Region Approach to the Optimal
Control of Stochastic Systems," by M. Dacre, K. Glazebrook,
J. Niño-Mora, Journal of the Royal Statistical Society, Series
B, 61 (1999), 783-784.
|
A.S. Schulz, Review of "Local Search in Combinatorial
Optimization," edited by E. Aarts and J.K. Lenstra, OPTIMA 59 (1998),
13-14. [newsletter]
|
A.S. Schulz, D.B. Shmoys, D.P. Williamson, Approximation
Algorithms, Proceedings of the National Academy of Sciences 94 (1997),
12734-12735. [article]
|
A.S. Schulz, Single Machine Scheduling subject to N-Sparse
Precedence Constraints, in U. Faigle, C. Hoede (eds.): Proceedings
of the 3rd Twente Workshop on Graphs and Combinatorial Optimization,
Memorandum No. 1132, Faculty of Applied Mathematics, University of
Twente, The Netherlands, 1993, 166-169.
|
Edited Volumes
P. Baptiste, J. Carlier, A. Munier, A.S. Schulz (eds.): Models
and Algorithms for Planning and Scheduling Problems, Annals of
Operations Research, Volume 129, Issue 1-4, Kluwer,
2004. [volume]
|
W.J. Cook, A.S. Schulz (eds.): Integer Programming and
Combinatorial Optimization, Lecture Notes in Computer Science
2337, Springer, Berlin, 2002, Proceedings of IPCO IX. [book]
|
Ph.D. Thesis
| A.S. Schulz, Polytopes and Scheduling, Department of
Mathematics, Technische Universität Berlin, Germany, February
1996. [thesis] |
|