Andreas S. Schulz

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 20

Top Topics

Congestion Games

Approximation Algorithms

Top Venues

Oper. Res. Lett.

Math. Oper. Res.

Publications

Felix Happach, Andreas S. Schulz
Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover. Math. Oper. Res. 49 (1) (2024)
Lukas Brandl, Andreas S. Schulz
Primal separation and approximation for the {0,1/2}-closure. Oper. Res. Lett. 57 (2024)
Andreas S. Schulz, Claudio Telha
Integer Factorization: Why Two-Item Joint Replenishment Is Hard. Oper. Res. 72 (3) (2024)
Andreas S. Schulz, Claudio Telha
On the complexity of a maintenance problem for hierarchical systems. Oper. Res. Lett. 54 (2024)
Lukas Brandl, Andreas S. Schulz
Primal Separation and Approximation for the {0, 1/2}-closure. CoRR (2023)
Andreas S. Schulz, Claudio Telha
On the complexity of a maintenance problem for hierarchical systems. CoRR (2023)
Yiannis Giannakopoulos, Georgy Noarov, Andreas S. Schulz
Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses. Math. Oper. Res. 47 (1) (2022)
Gero Friesecke, Andreas S. Schulz, Daniela Vögler
Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems. SIAM J. Sci. Comput. 44 (1) (2022)
Matthias Brugger, Andreas S. Schulz
On the complexity of recognizing integrality and total dual integrality of the {0, 1/2}-closure. Oper. Res. Lett. 50 (1) (2022)
Matthias Brugger, Andreas S. Schulz
On the Complexity of Recognizing Integrality and Total Dual Integrality of the {0, 1/2}-Closure. CoRR (2021)
Gero Friesecke, Andreas S. Schulz, Daniela Vögler
Genetic column generation: Fast computation of high-dimensional multi-marginal optimal transport problems. CoRR (2021)
Layla Martin, Stefan Minner, Diogo Poças, Andreas S. Schulz
The Competitive Pickup and Delivery Orienteering Problem for Balancing Car-Sharing Systems. Transp. Sci. 55 (6) (2021)
Andreas S. Schulz, Claudio Telha
Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard. CoRR (2020)
Felix Happach, Andreas S. Schulz
Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover. CoRR (2020)
Felix Happach, Andreas S. Schulz
Precedence-Constrained Scheduling and Min-Sum Set Cover. WAOA (2019)
Andreas S. Schulz, Rajan Udwani
Robust Appointment Scheduling with Heterogeneous Costs. APPROX-RANDOM (2019)
Yiannis Giannakopoulos, Georgy Noarov, Andreas S. Schulz
An Improved Algorithm for Computing Approximate Equilibria in Weighted Congestion Games. CoRR (2018)
James B. Orlin, Andreas S. Schulz, Rajan Udwani
Robust monotone submodular function maximization. Math. Program. 172 (1-2) (2018)
Andreas S. Schulz, José Verschae
Min-Sum Scheduling Under Precedence Constraints. ESA (2016)
James B. Orlin, Andreas S. Schulz, Rajan Udwani
Robust Monotone Submodular Function Maximization. IPCO (2016)
James B. Orlin, Andreas S. Schulz, Rajan Udwani
Robust Monotone Submodular Function Maximization. CoRR (2015)
Shashi Mittal, Andreas S. Schulz, Sebastian Stiller
Robust Appointment Scheduling. APPROX-RANDOM (2014)
Shashi Mittal, Andreas S. Schulz
An FPTAS for optimizing a class of low-rank functions over a polytope. Math. Program. 141 (1-2) (2013)
Andreas S. Schulz, Nelson A. Uhan
Approximating the least core value and least core of cooperative games with supermodular costs. Discret. Optim. 10 (2) (2013)
José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
The Price of Anarchy of the Proportional Allocation Mechanism Revisited. WINE (2013)
Shashi Mittal, Andreas S. Schulz
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One. Oper. Res. 61 (2) (2013)
Juliane Dunkel, Andreas S. Schulz
The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope. Math. Oper. Res. 38 (1) (2013)
Carol A. Meyers, Andreas S. Schulz
The complexity of welfare maximization in congestion games. Networks 59 (2) (2012)
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. 36 (1) (2011)
Andreas S. Schulz, Claudio Telha
Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands. ESA (2011)
Juliane Dunkel, Andreas S. Schulz
The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope. OR (2011)
Adam N. Letchford, Sebastian Pokutta, Andreas S. Schulz
On the membership problem for the {0, 1/2}-closure. Oper. Res. Lett. 39 (5) (2011)
Sebastian Pokutta, Andreas S. Schulz
Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank. Oper. Res. Lett. 39 (6) (2011)
Andreas S. Schulz, Nelson A. Uhan
Sharing Supermodular Costs. Oper. Res. 58 (4-Part-2) (2010)
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. 38 (5) (2010)
Sebastian Pokutta, Andreas S. Schulz
On the Rank of Cutting-Plane Proof Systems. IPCO (2010)
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
Integer Programming: Optimization and Evaluation Are Equivalent. WADS (2009)
Andreas S. Schulz, Nelson A. Uhan
Sharing Supermodular Costs. Models and Algorithms for Optimization in Logistics (2009)
Nicole Immorlica, Li (Erran) Li, Vahab S. Mirrokni, Andreas S. Schulz
Coordination mechanisms for selfish scheduling. Theor. Comput. Sci. 410 (17) (2009)
Carol A. Meyers, Andreas S. Schulz
Integer equal flows. Oper. Res. Lett. 37 (4) (2009)
James B. Orlin, Andreas S. Schulz, Sudipta Sengupta
epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems. Discret. Optim. 5 (2) (2008)
José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
A geometric approach to the price of anarchy in nonatomic congestion games. Games Econ. Behav. 64 (2) (2008)
Andreas S. Schulz
Stochastic Online Scheduling Revisited. COCOA (2008)
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)
Juliane Dunkel, Andreas S. Schulz
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. Math. Oper. Res. 33 (4) (2008)
Andreas S. Schulz
On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming. Bonn Workshop of Combinatorial Optimization (2008)
José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
Fast, Fair, and Efficient Flows in Networks. Oper. Res. 55 (2) (2007)
Andreas S. Schulz, Nelson A. Uhan
Encouraging Cooperation in Sharing Supermodular Costs. APPROX-RANDOM (2007)
Maurice Queyranne, Andreas S. Schulz
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. SIAM J. Comput. 35 (5) (2006)
Andreas S. Schulz, Nicolás E. Stier Moses
Efficiency and fairness of system-optimal routing with user constraints. Networks 48 (4) (2006)
Juliane Dunkel, Andreas S. Schulz
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. WINE (2006)
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. Oper. Res. 53 (4) (2005)
José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
On the Inefficiency of Equilibria in Congestion Games. IPCO (2005)
José R. Correa, Andreas S. Schulz
Single-Machine Scheduling with Precedence Constraints. Math. Oper. Res. 30 (4) (2005)
Andreas S. Schulz
New Old Algorithms for Stochastic Scheduling. Algorithms for Optimization with Incomplete Information (2005)
Nicole Immorlica, Erran L. Li, Vahab S. Mirrokni, Andreas S. Schulz
Coordination Mechanisms for Selfish Scheduling. WINE (2005)
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)
Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz
Introduction. Ann. Oper. Res. 129 (1-4) (2004)
Nicole Megow, Andreas S. Schulz
On-line scheduling to minimize average completion time revisited. Oper. Res. Lett. 32 (5) (2004)
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
Approximate Local Search in Combinatorial Optimization. SIAM J. Comput. 33 (5) (2004)
José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
Selfish Routing in Capacitated Networks. Math. Oper. Res. 29 (4) (2004)
James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
Approximate local search in combinatorial optimization. SODA (2004)
José R. Correa, Andreas S. Schulz
Single Machine Scheduling with Precedence Constraints: Extended Abstract. IPCO (2004)
Friedrich Eisenbrand, Andreas S. Schulz
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. Comb. 23 (2) (2003)
Andreas S. Schulz, Nicolás E. Stier Moses
On the performance of user equilibria in traffic networks. SODA (2003)
Nicole Megow, Andreas S. Schulz
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms. WAOA (2003)
Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz
Solving Project Scheduling Problems by Minimum Cut Computations. Manag. Sci. 49 (3) (2003)
Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang
Single Machine Scheduling with Release Dates. SIAM J. Discret. Math. 15 (2) (2002)
Rudolf Müller, Andreas S. Schulz
Transitive Packing: A Unifying Concept in Combinatorial Optimization. SIAM J. Optim. 13 (2) (2002)
Andreas S. Schulz, Martin Skutella
Scheduling Unrelated Machines by Randomized Rounding. SIAM J. Discret. Math. 15 (4) (2002)
Andreas S. Schulz, Robert Weismantel
The Complexity of Generic Primal Algorithms for Solving General Integer Programs. Math. Oper. Res. 27 (4) (2002)
Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz
On project scheduling with irregular starting time costs. Oper. Res. Lett. 28 (4) (2001)
James B. Orlin, Andreas S. Schulz, Sudipta Sengupta
epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract). STOC (2000)
Rolf H. Möhring, Andreas S. Schulz, Marc Uetz
Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies. RANDOM-APPROX (1999)
Friedrich Eisenbrand, Andreas S. Schulz
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. IPCO (1999)
Andreas S. Schulz, Robert Weismantel
An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. SODA (1999)
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)
Alexander Bockmayr, Friedrich Eisenbrand, Mark E. Hartmann, Andreas S. Schulz
On the Chvátal Rank of Polytopes in the 0/1 Cube. Discret. Appl. Math. 98 (1-2) (1999)
Rolf H. Möhring, Andreas S. Schulz, Marc Uetz
Approximation in stochastic scheduling: the power of LP-based priority policies. J. ACM 46 (6) (1999)
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) (1998)
Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz
Switchbox Routing in VLSI Design: Closing the Complexity Gap. Theor. Comput. Sci. 203 (1) (1998)
Alix Munier, Maurice Queyranne, Andreas S. Schulz
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. IPCO (1998)
Rainer Schrader, Andreas S. Schulz, Georg Wambach
Base polytopes of series-parallel posets: Linear description and optimization. Math. Program. 82 (1998)
Andreas S. Schulz, Martin Skutella
Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. ESA (1997)
Annelie von Arnim, Andreas S. Schulz
Facets of the Generalized Permutahedron of a Poset. Discret. Appl. Math. 72 (1-2) (1997)
Leslie A. Hall, Andreas S. Schulz, David B. Shmoys, Joel Wein
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms. Math. Oper. Res. 22 (3) (1997)
Andreas S. Schulz, Martin Skutella
Random-Based Scheduling: New Approximations and LP Lower Bounds. RANDOM (1997)
Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein
Improved Scheduling Algorithms for Minsum Criteria. ICALP (1996)
Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz
Switchbox Routing in VLSI Design: Closing the Complexity Gap. WG (1996)
Andreas S. Schulz
Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds. IPCO (1996)
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)
Rudolf Müller, Andreas S. Schulz
Transitive Packing. IPCO (1996)
Rudolf Müller, Andreas S. Schulz
The Interval Order Polytope of a Digraph. IPCO (1995)
Maurice Queyranne, Andreas S. Schulz
Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds. IPCO (1995)
Andreas S. Schulz, Robert Weismantel, Günter M. Ziegler
0/1-Integer Programming: Optimization and Augmentation are Equivalent. ESA (1995)
Andreas S. Schulz
The Permutahedron of Series-parallel Posets. Discret. Appl. Math. 57 (1) (1995)