2009 |
48 | EE | Nicole Immorlica,
Li (Erran) Li,
Vahab S. Mirrokni,
Andreas S. Schulz:
Coordination mechanisms for selfish scheduling.
Theor. Comput. Sci. 410(17): 1589-1598 (2009) |
2008 |
47 | EE | Shashi Mittal,
Andreas S. Schulz:
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One.
APPROX-RANDOM 2008: 179-192 |
46 | EE | Andreas S. Schulz:
Stochastic Online Scheduling Revisited.
COCOA 2008: 448-457 |
45 | EE | James B. Orlin,
Andreas S. Schulz,
Sudipta Sengupta:
epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems.
Discrete Optimization 5(2): 550-561 (2008) |
2007 |
44 | EE | Andreas S. Schulz,
Nelson A. Uhan:
Encouraging Cooperation in Sharing Supermodular Costs.
APPROX-RANDOM 2007: 271-285 |
2006 |
43 | EE | Juliane Dunkel,
Andreas S. Schulz:
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games.
WINE 2006: 62-73 |
42 | EE | Andreas S. Schulz,
Nicolás E. Stier Moses:
Efficiency and fairness of system-optimal routing with user constraints.
Networks 48(4): 223-234 (2006) |
41 | EE | Maurice Queyranne,
Andreas S. Schulz:
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.
SIAM J. Comput. 35(5): 1241-1253 (2006) |
2005 |
40 | EE | Andreas S. Schulz:
New Old Algorithms for Stochastic Scheduling.
Algorithms for Optimization with Incomplete Information 2005 |
39 | EE | José R. Correa,
Andreas S. Schulz,
Nicolás E. Stier Moses:
On the Inefficiency of Equilibria in Congestion Games.
IPCO 2005: 167-181 |
38 | EE | Nicole Immorlica,
Li Li,
Vahab S. Mirrokni,
Andreas S. Schulz:
Coordination Mechanisms for Selfish Scheduling.
WINE 2005: 55-69 |
2004 |
37 | EE | José R. Correa,
Andreas S. Schulz:
Single Machine Scheduling with Precedence Constraints: Extended Abstract.
IPCO 2004: 283-297 |
36 | EE | José R. Correa,
Andreas S. Schulz,
Nicolás E. Stier Moses:
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract.
IPCO 2004: 59-73 |
35 | EE | James B. Orlin,
Abraham P. Punnen,
Andreas S. Schulz:
Approximate local search in combinatorial optimization.
SODA 2004: 587-596 |
34 | EE | José R. Correa,
Andreas S. Schulz,
Nicolás E. Stier Moses:
Selfish Routing in Capacitated Networks.
Math. Oper. Res. 29(4): 961-976 (2004) |
33 | EE | Nicole Megow,
Andreas S. Schulz:
On-line scheduling to minimize average completion time revisited.
Oper. Res. Lett. 32(5): 485-490 (2004) |
32 | EE | James B. Orlin,
Abraham P. Punnen,
Andreas S. Schulz:
Approximate Local Search in Combinatorial Optimization.
SIAM J. Comput. 33(5): 1201-1214 (2004) |
2003 |
31 | EE | Andreas S. Schulz,
Nicolás E. Stier Moses:
On the performance of user equilibria in traffic networks.
SODA 2003: 86-87 |
30 | EE | Nicole Megow,
Andreas S. Schulz:
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms.
WAOA 2003: 227-234 |
29 | EE | Friedrich Eisenbrand,
Andreas S. Schulz:
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.
Combinatorica 23(2): 245-261 (2003) |
2002 |
28 | | William Cook,
Andreas S. Schulz:
Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings
Springer 2002 |
27 | EE | Andreas S. Schulz,
Robert Weismantel:
The Complexity of Generic Primal Algorithms for Solving General Integer Programs.
Math. Oper. Res. 27(4): 681-692 (2002) |
26 | EE | Michel X. Goemans,
Maurice Queyranne,
Andreas S. Schulz,
Martin Skutella,
Yaoguang Wang:
Single Machine Scheduling with Release Dates.
SIAM J. Discrete Math. 15(2): 165-192 (2002) |
25 | EE | Andreas S. Schulz,
Martin Skutella:
Scheduling Unrelated Machines by Randomized Rounding.
SIAM J. Discrete Math. 15(4): 450-469 (2002) |
2001 |
24 | EE | Rolf H. Möhring,
Andreas S. Schulz,
Frederik Stork,
Marc Uetz:
On project scheduling with irregular starting time costs.
Oper. Res. Lett. 28(4): 149-154 (2001) |
2000 |
23 | EE | James B. Orlin,
Andreas S. Schulz,
Sudipta Sengupta:
epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract).
STOC 2000: 565-572 |
1999 |
22 | EE | Rolf H. Möhring,
Andreas S. Schulz,
Frederik Stork,
Marc Uetz:
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems.
ESA 1999: 139-150 |
21 | EE | Friedrich Eisenbrand,
Andreas S. Schulz:
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.
IPCO 1999: 137-150 |
20 | | Rolf H. Möhring,
Andreas S. Schulz,
Marc Uetz:
Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies.
RANDOM-APPROX 1999: 144-155 |
19 | EE | Andreas S. Schulz,
Robert Weismantel:
An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming.
SODA 1999: 967-968 |
18 | EE | Alexander Bockmayr,
Friedrich Eisenbrand,
Mark E. Hartmann,
Andreas S. Schulz:
On the Chvátal Rank of Polytopes in the 0/1 Cube.
Discrete Applied Mathematics 98(1-2): 21-27 (1999) |
17 | EE | Rolf H. Möhring,
Andreas S. Schulz,
Marc Uetz:
Approximation in stochastic scheduling: the power of LP-based priority policies.
J. ACM 46(6): 924-942 (1999) |
1998 |
16 | EE | Alix Munier,
Maurice Queyranne,
Andreas S. Schulz:
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.
IPCO 1998: 367-382 |
15 | | Cynthia A. Phillips,
Andreas S. Schulz,
David B. Shmoys,
Clifford Stein,
Joel Wein:
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem.
J. Comb. Optim. 1(4): 413-426 (1998) |
14 | | Rainer Schrader,
Andreas S. Schulz,
Georg Wambach:
Base polytopes of series-parallel posets: Linear description and optimization.
Math. Program. 82: 159-173 (1998) |
13 | EE | Stephan Hartmann,
Markus W. Schäffter,
Andreas S. Schulz:
Switchbox Routing in VLSI Design: Closing the Complexity Gap.
Theor. Comput. Sci. 203(1): 31-49 (1998) |
1997 |
12 | | Andreas S. Schulz,
Martin Skutella:
Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria.
ESA 1997: 416-429 |
11 | | Andreas S. Schulz,
Martin Skutella:
Random-Based Scheduling: New Approximations and LP Lower Bounds.
RANDOM 1997: 119-133 |
10 | EE | Annelie von Arnim,
Andreas S. Schulz:
Facets of the Generalized Permutahedron of a Poset.
Discrete Applied Mathematics 72(1-2): 179-192 (1997) |
1996 |
9 | | Rolf H. Möhring,
Markus W. Schäffter,
Andreas S. Schulz:
Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract).
ESA 1996: 76-90 |
8 | | Soumen Chakrabarti,
Cynthia A. Phillips,
Andreas S. Schulz,
David B. Shmoys,
Clifford Stein,
Joel Wein:
Improved Scheduling Algorithms for Minsum Criteria.
ICALP 1996: 646-657 |
7 | | Andreas S. Schulz:
Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds.
IPCO 1996: 301-315 |
6 | | Rudolf Müller,
Andreas S. Schulz:
Transitive Packing.
IPCO 1996: 430-444 |
5 | | Stephan Hartmann,
Markus W. Schäffter,
Andreas S. Schulz:
Switchbox Routing in VLSI Design: Closing the Complexity Gap.
WG 1996: 196-210 |
1995 |
4 | | Andreas S. Schulz,
Robert Weismantel,
Günter M. Ziegler:
0/1-Integer Programming: Optimization and Augmentation are Equivalent.
ESA 1995: 473-483 |
3 | | Maurice Queyranne,
Andreas S. Schulz:
Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds.
IPCO 1995: 307-320 |
2 | | Rudolf Müller,
Andreas S. Schulz:
The Interval Order Polytope of a Digraph.
IPCO 1995: 50-64 |
1 | EE | Andreas S. Schulz:
The Permutahedron of Series-parallel Posets.
Discrete Applied Mathematics 57(1): 85-90 (1995) |