

Home  Preprints  Book Chapters 
Journal Articles  Conference Articles  Miscellaneous  Edited
Volumes  Thesis
Preprints
A.S. Schulz, C. Telha, Breaking publickey cryptosystems with inventory management, April 2013. [Available upon request]

S. Pokutta, A.S. Schulz, On the rank of cuttingplane proof systems (full version), February 2013. [preprint]

A.S. Schulz, From linear programming relaxations to approximation algorithms for scheduling problems: A tour d'horizon, last revised in August 2012. [Available upon request]

J. Dunkel, A.S. Schulz, A refined GomoryChvátal closure for polytopes in the unit cube, March 2012. [preprint]

S. Pokutta, A.S. Schulz, On the connection of the SheraliAdams closure and border bases, last revised in November 2010. [preprint]

P.R. Goundan, A.S. Schulz, Revisiting the greedy approach
to submodular set function maximization, last revised in January 2009. [preprint]

E.L. Lawler, M. Queyranne, A.S. Schulz, D.B. Shmoys, Weighted
sum of completion times, last revised in November 2006. [Available upon request]

M. Queyranne, A.S. Schulz, Polyhedral approaches to
machine scheduling, last revised in September 2004. [Available upon request]

Book Chapters
A.S. Schulz, On the relative complexity of 15 problems related
to 0/1integer programming, Chapter 19 in W.J. Cook, L. Lovász,
J. Vygen (eds.): Research Trends in Combinatorial Optimization,
Springer, Berlin, 2009, pp. 399428. [preprint]

Journal Articles
S. Mittal, A.S. Schulz, An FPTAS for optimizing a class of lowrank functions over a polytope, Mathematical Programming, to appear. [preprint]

J. Dunkel, A.S. Schulz, The GomoryChvátal closure of a nonrational polytope is a rational polytope, Mathematics of Operations Research 38 (2013), 6391. [article]

S. Mittal, A.S. Schulz, A general framework for designing approximation schemes for combinatorial optimization problems with many objectives combined into one, Operations Research 61 (2013), 386397. [article]

A.S. Schulz, N. Uhan, Approximating the least core value and least core of cooperative games with supermodular costs, Discrete Optimization 10 (2013), 163180. [article]

C.A. Meyers, A.S. Schulz, The complexity of welfare
maximization in congestion games, Networks 59 (2012), 252260. [article]

S. Pokutta, A.S. Schulz, Integerempty polytopes in the 0/1cube with maximal GomoryChvatal rank, Operations Research Letters 39 (2011), 457460. [article]

A.N. Letchford, S. Pokutta, A.S. Schulz, On the membership problem for the {0,1/2}closure, Operations Research Letters 39 (2011), 301304. [article]

A.S. Schulz, N.A. Uhan, Nearoptimal solutions and large
integrality gaps for almost all instances of singlemachine
precedenceconstrained scheduling, Mathematics of Operations Research
36 (2011),
1423. [article]

M. Mastrolilli, M. Queyranne, A.S. Schulz, O. Svensson,
N.A. Uhan, Minimizing the sum of weighted completion times in a
concurrent open shop, Operations Research Letters 38 (2010), 390395. [article]

A.S. Schulz, N. Uhan, Sharing supermodular costs, Operations Research 58 (2010), 10511056. [article]

C.A. Meyers, A.S. Schulz, Integer equal flows, Operations Research Letters 37 (2009), 245249. [article]

N. Immorlica, L. Li, V.S. Mirrokni, A.S. Schulz,
Coordination mechanisms for selfish scheduling, Theoretical
Computer Science 410 (2009), 15891598. [article]

J. Dunkel, A.S. Schulz, On the complexity of purestrategy
Nash equilibria in congestion and localeffect games, Mathematics of
Operations Research 33 (2008), 851868. [article]

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 64 (2008), 457469. [article]

J.B. Orlin, A.S. Schulz, S. Sengupta, εoptimization
schemes and Lbit precision: Alternative perspectives in combinatorial
optimization, Discrete Optimization 5 (2008), 550561. [article]

J.R. Correa, A.S. Schulz, N.E. Stier Moses, Fast, fair,
and efficient flows in networks, Operations Research 55 (2007),
215225. [article]

A.S. Schulz, N.E. Stier Moses, Efficiency and fairness of
systemoptimal routing with user constraints, Networks 48 (2006),
223234. [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), 12411253. [article]

J.R. Correa, A.S. Schulz, Singlemachine scheduling with
precedence constraints, Mathematics of Operations Research 30
(2005), 10051021. [article]

O. Jahn, R.H. Möhring, A.S. Schulz, N.E. Stier Moses,
Systemoptimal routing of traffic flows with user constraints in
networks with congestion, Operations Research 53 (2005), 600616.
[article]

J.R. Correa, A.S. Schulz, N.E. Stier Moses, Selfish
routing in capacitated networks, Mathematics of Operations
Research 29 (2004), 961976. [article]

J.B. Orlin, A.P. Punnen, A.S. Schulz, Approximate local
search in combinatorial optimization, SIAM Journal on Computing
33 (2004), 12011214. [article]

N. Megow, A.S. Schulz, Online scheduling to minimize
average completion time revisited, Operations Research Letters 32
(2004), 485490. [article]

F. Eisenbrand, A.S. Schulz, Bounds on the Chvátal
rank of polytopes in the 0/1cube, Combinatorica 23 (2003),
245261. [article]

R.H. Möhring, A.S. Schulz, F. Stork, M. Uetz, Solving
project scheduling problems by minimum cut computations,
Management Science 49 (2003), 330350. [article]

A.S. Schulz, R. Weismantel, The complexity of generic
primal algorithms for solving general integer programs,
Mathematics of Operations Research 27 (2002), 681692. [article]

R. Müller, A.S. Schulz, Transitive packing: A
unifying concept in combinatorial optimization, SIAM Journal on
Optimization 13 (2002), 335367. [article]

A.S. Schulz, M. Skutella, Scheduling unrelated machines by
randomized rounding, SIAM Journal on Discrete Mathematics 15
(2002), 450469. [article]

A.S. Schulz, M. Skutella, The power of αpoints in
preemptive single machine scheduling, Journal of Scheduling 5
(2002), 121133. [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), 165192. [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), 149154. [article]

R.H. Möhring, A.S. Schulz, M. Uetz, Approximation in
stochastic scheduling: The power of LPbased priority policies,
Journal of the ACM 46 (1999), 924942. [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), 2127. [article]

S. Hartmann, M.W. Schäffter, A.S. Schulz, Switchbox
routing in VLSI design: Closing the complexity gap, Theoretical
Computer Science 203 (1998), 3149. [article]

R. Schrader, A.S. Schulz, G. Wambach, Base polytopes of
seriesparallel posets: Linear description and optimization,
Mathematical Programming 82 (1998), 159173.
[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), 413426. [article]

L.A. Hall, A.S. Schulz, D.B. Shmoys, J. Wein, Scheduling
to minimize average completion time: Offline and online
approximation algorithms, Mathematics of Operations Research 22
(1997), 513544. [article]

A. von Arnim, A.S. Schulz, Facets of the generalized
permutahedron of a poset, Discrete Applied Mathematics 72 (1997),
179192. [article]

A.S. Schulz, The permutahedron of seriesparallel
posets, Discrete Applied Mathematics 57 (1995), 8590. [article]

Articles in Refereed Conference Proceedings
A.S. Schulz, C. Telha, Approximation algorithms and hardness
results for the joint replenishment problem with constant demands, ESA
2011. [article]

S. Pokutta, A.S. Schulz, On the rank of cuttingplane proof
systems, IPCO 2010. [article]

J.B. Orlin, A.P. Punnen, A.S. Schulz, Integer programming:
Optimization and evaluation are equivalent, WADS 2009. [article]

S. Mittal, A.S. Schulz, A general framework for designing
approximation schemes for combinatorial optimization problems with
many objectives combined into one, APPROX 2008. [article]

A.S. Schulz, Stochastic online scheduling revisited, COCOA
2008. [article]

A.S. Schulz, N.A. Uhan, Encouraging cooperation in sharing
supermodular costs, APPROX 2007. [article]

J. Dunkel, A.S. Schulz, On the complexity of purestrategy
Nash equilibria in congestion and localeffect 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 online 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 Lbit 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 LPbased priority policies,
APPROX 1999. [article]

R.H. Möhring, A.S. Schulz, F. Stork, M. Uetz,
Resourceconstrained 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/1cube, IPCO VII, 1999. [article]

A.S. Schulz, R. Weismantel, An oraclepolynomial time
augmentation algorithm for integer programming, SODA 1999. [article]

R.H. Möhring, M. Oellrich, A.S. Schulz, Exact algorithms
for the minimumcost 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, SchedulingLPs bear probabilities:
Randomized approximations for minsum criteria, ESA 1997. [article]

A.S. Schulz, M. Skutella, Randombased 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 LPbased heuristics and lower bounds,
IPCO V, 1996. [article]

A.S. Schulz, R. Weismantel, G.M. Ziegler, 0/1integer
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ñoMora, Journal of the Royal Statistical Society, Series
B, 61 (1999), 783784.

A.S. Schulz, Review of "Local Search in Combinatorial
Optimization," edited by E. Aarts and J.K. Lenstra, OPTIMA 59 (1998),
1314. [newsletter]

A.S. Schulz, D.B. Shmoys, D.P. Williamson, Approximation
algorithms, Proceedings of the National Academy of Sciences 94 (1997),
1273412735. [article]

A.S. Schulz, Single machine scheduling subject to Nsparse
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, 166169.

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 14, 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] 
