| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Carol A. Meyers, Andreas S. Schulz |
The complexity of welfare maximization in congestion games.  |
Networks  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Pokutta, Andreas S. Schulz |
Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank. |
Oper. Res. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam N. Letchford, Sebastian Pokutta, Andreas S. Schulz |
On the membership problem for the {0, 1/2}-closure. |
Oper. Res. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Nelson A. Uhan |
Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling. |
Math. Oper. Res. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Claudio Telha |
Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan |
Minimizing the sum of weighted completion times in a concurrent open shop. |
Oper. Res. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Nelson A. Uhan |
Sharing Supermodular Costs. |
Operations Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Pokutta, Andreas S. Schulz |
On the Rank of Cutting-Plane Proof Systems. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Carol A. Meyers, Andreas S. Schulz |
Integer equal flows. |
Oper. Res. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Immorlica, Li (Erran) Li, Vahab S. Mirrokni, Andreas S. Schulz |
Coordination mechanisms for selfish scheduling. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | James B. Orlin, Abraham P. Punnen, Andreas S. Schulz |
Integer Programming: Optimization and Evaluation Are Equivalent. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | James B. Orlin, Andreas S. Schulz, Sudipta Sengupta |
epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses |
A geometric approach to the price of anarchy in nonatomic congestion games. |
Games and Economic Behavior |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Juliane Dunkel, Andreas S. Schulz |
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. |
Math. Oper. Res. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz |
Stochastic Online Scheduling Revisited. |
COCOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses |
Fast, Fair, and Efficient Flows in Networks. |
Operations Research |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Nelson A. Uhan |
Encouraging Cooperation in Sharing Supermodular Costs. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Nicolás E. Stier Moses |
Efficiency and fairness of system-optimal routing with user constraints. |
Networks |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Queyranne, Andreas S. Schulz |
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Juliane Dunkel, Andreas S. Schulz |
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. |
WINE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Jahn, Rolf H. Möhring, Andreas S. Schulz, Nicolás E. Stier Moses |
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion. |
Operations Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | José R. Correa, Andreas S. Schulz |
Single-Machine Scheduling with Precedence Constraints. |
Math. Oper. Res. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Immorlica, Li Li, Vahab S. Mirrokni, Andreas S. Schulz |
Coordination Mechanisms for Selfish Scheduling. |
WINE |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz |
New Old Algorithms for Stochastic Scheduling. |
Algorithms for Optimization with Incomplete Information |
2005 |
DBLP BibTeX RDF |
|
| 1 | José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses |
On the Inefficiency of Equilibria in Congestion Games. |
IPCO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Megow, Andreas S. Schulz |
On-line scheduling to minimize average completion time revisited. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses |
Selfish Routing in Capacitated Networks. |
Math. Oper. Res. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz |
Introduction. |
Annals OR |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | James B. Orlin, Abraham P. Punnen, Andreas S. Schulz |
Approximate Local Search in Combinatorial Optimization. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | James B. Orlin, Abraham P. Punnen, Andreas S. Schulz |
Approximate local search in combinatorial optimization. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | José R. Correa, Andreas S. Schulz |
Single Machine Scheduling with Precedence Constraints: Extended Abstract. |
IPCO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Eisenbrand, Andreas S. Schulz |
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. |
Combinatorica |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 52B05, 90C27, 68Q17, 90C57, 90C10, 90C60 |
| 1 | Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz |
Solving Project Scheduling Problems by Minimum Cut Computations. |
Management Science |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Nicolás E. Stier Moses |
On the performance of user equilibria in traffic networks. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Megow, Andreas S. Schulz |
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms. |
WAOA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Müller, Andreas S. Schulz |
Transitive Packing: A Unifying Concept in Combinatorial Optimization. |
SIAM Journal on Optimization |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Robert Weismantel |
The Complexity of Generic Primal Algorithms for Solving General Integer Programs. |
Math. Oper. Res. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang |
Single Machine Scheduling with Release Dates. |
SIAM J. Discrete Math. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Martin Skutella |
Scheduling Unrelated Machines by Randomized Rounding. |
SIAM J. Discrete Math. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | William Cook, Andreas S. Schulz (eds.) |
Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings |
IPCO |
2002 |
DBLP BibTeX RDF |
|
| 1 | Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz |
On project scheduling with irregular starting time costs. |
Oper. Res. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | James B. Orlin, Andreas S. Schulz, Sudipta Sengupta |
epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract). |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf H. Möhring, Andreas S. Schulz, Marc Uetz |
Approximation in stochastic scheduling: the power of LP-based priority policies. |
J. ACM |
1999 |
DBLP DOI BibTeX RDF |
WSEPT rule, approximaion, priority poliy, stochastic scheduling, LP-relaxation, asymptotic optimality, worst-case performance |
| 1 | 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 |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Robert Weismantel |
An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Eisenbrand, Andreas S. Schulz |
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. |
IPCO |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf H. Möhring, Andreas S. Schulz, Marc Uetz |
Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies. |
RANDOM-APPROX |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz |
Switchbox Routing in VLSI Design: Closing the Complexity Gap. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Schrader, Andreas S. Schulz, Georg Wambach |
Base polytopes of series-parallel posets: Linear description and optimization. |
Math. Program. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Alix Munier, Maurice Queyranne, Andreas S. Schulz |
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. |
IPCO |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Annelie von Arnim, Andreas S. Schulz |
Facets of the Generalized Permutahedron of a Poset. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Martin Skutella |
Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. |
ESA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Martin Skutella |
Random-Based Scheduling: New Approximations and LP Lower Bounds. |
RANDOM |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz |
Switchbox Routing in VLSI Design: Closing the Complexity Gap. |
WG |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein |
Improved Scheduling Algorithms for Minsum Criteria. |
ICALP |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Müller, Andreas S. Schulz |
Transitive Packing. |
IPCO |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz |
Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds. |
IPCO |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz |
The Permutahedron of Series-parallel Posets. |
Discrete Applied Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Robert Weismantel, Günter M. Ziegler |
0/1-Integer Programming: Optimization and Augmentation are Equivalent. |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Queyranne, Andreas S. Schulz |
Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds. |
IPCO |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Müller, Andreas S. Schulz |
The Interval Order Polytope of a Digraph. |
IPCO |
1995 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")