Andreas S. Schulz

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