Andreas S. Schulz
Orcid: 0000-0002-9595-459XAffiliations:
- Technical University Munich, Germany
According to our database1,
Andreas S. Schulz
authored at least 83 papers
between 1995 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on or.tum.de
On csauthors.net:
Bibliography
2023
2022
Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems.
SIAM J. Sci. Comput., February, 2022
On the complexity of recognizing integrality and total dual integrality of the {0, 1/2}-closure.
Oper. Res. Lett., 2022
Math. Oper. Res., 2022
2021
The Competitive Pickup and Delivery Orienteering Problem for Balancing Car-Sharing Systems.
Transp. Sci., 2021
Genetic column generation: Fast computation of high-dimensional multi-marginal optimal transport problems.
CoRR, 2021
2020
Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard.
CoRR, 2020
Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover.
CoRR, 2020
2019
Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019
Proceedings of the Approximation, 2019
2018
An Improved Algorithm for Computing Approximate Equilibria in Weighted Congestion Games.
CoRR, 2018
2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015
2014
2013
Math. Program., 2013
Math. Oper. Res., 2013
A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One.
Oper. Res., 2013
Approximating the least core value and least core of cooperative games with supermodular costs.
Discret. Optim., 2013
Proceedings of the Web and Internet Economics - 9th International Conference, 2013
2012
2011
Oper. Res. Lett., 2011
Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling.
Math. Oper. Res., 2011
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011
Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands.
Proceedings of the Algorithms - ESA 2011, 2011
2010
Oper. Res. Lett., 2010
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
2009
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
2008
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games.
Math. Oper. Res., 2008
Games Econ. Behav., 2008
epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems.
Discret. Optim., 2008
Proceedings of the Combinatorial Optimization and Applications, 2008
Proceedings of the Research Trends in Combinatorial Optimization, 2008
2007
Proceedings of the Approximation, 2007
2006
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.
SIAM J. Comput., 2006
Networks, 2006
2005
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion.
Oper. Res., 2005
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005
2004
Oper. Res. Lett., 2004
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
2003
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
2002
SIAM J. Optim., 2002
Math. Oper. Res., 2002
2001
2000
epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
1999
J. ACM, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies.
Proceedings of the Randomization, 1999
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems.
Proceedings of the Algorithms, 1999
1998
Theor. Comput. Sci., 1998
Math. Program., 1998
J. Comb. Optim., 1998
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998
1997
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms.
Math. Oper. Res., 1997
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997
Proceedings of the Algorithms, 1997
1996
Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996
Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract).
Proceedings of the Algorithms, 1996
1995
Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
Proceedings of the Algorithms, 1995