Andreas S. Schulz

According to our database1, Andreas S. Schulz authored at least 82 papers between 1995 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Robust Appointment Scheduling with Heterogeneous Costs.
Proceedings of the Approximation, 2019

2018
Robust monotone submodular function maximization.
Math. Program., 2018

An Improved Algorithm for Computing Approximate Equilibria in Weighted Congestion Games.
CoRR, 2018

2016
Robust Monotone Submodular Function Maximization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

Min-Sum Scheduling Under Precedence Constraints.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Robust Monotone Submodular Function Maximization.
CoRR, 2015

Selfish Routing and Proportional Resource Allocation.
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014
Robust Appointment Scheduling.
Proceedings of the Approximation, 2014

2013
An FPTAS for optimizing a class of low-rank functions over a polytope.
Math. Program., 2013

The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope.
Math. Oper. Res., 2013

A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One.
Operations Research, 2013

Approximating the least core value and least core of cooperative games with supermodular costs.
Discrete Optimization, 2013

The Price of Anarchy of the Proportional Allocation Mechanism Revisited.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012
The complexity of welfare maximization in congestion games.
Networks, 2012

2011
Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank.
Oper. Res. Lett., 2011

On the membership problem for the {0, 1/2}-closure.
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

The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope.
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
Minimizing the sum of weighted completion times in a concurrent open shop.
Oper. Res. Lett., 2010

Sharing Supermodular Costs.
Operations Research, 2010

On the Rank of Cutting-Plane Proof Systems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
Coordination mechanisms for selfish scheduling.
Theor. Comput. Sci., 2009

Integer equal flows.
Oper. Res. Lett., 2009

Integer Programming: Optimization and Evaluation Are Equivalent.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Sharing Supermodular Costs.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

2008
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games.
Math. Oper. Res., 2008

A geometric approach to the price of anarchy in nonatomic congestion games.
Games and Economic Behavior, 2008

epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems.
Discrete Optimization, 2008

Stochastic Online Scheduling Revisited.
Proceedings of the Combinatorial Optimization and Applications, 2008

On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One.
Proceedings of the Approximation, 2008

2007
Fast, Fair, and Efficient Flows in Networks.
Operations Research, 2007

Encouraging Cooperation in Sharing Supermodular Costs.
Proceedings of the Approximation, 2007

2006
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.
SIAM J. Comput., 2006

Efficiency and fairness of system-optimal routing with user constraints.
Networks, 2006

On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

2005
Single-Machine Scheduling with Precedence Constraints.
Math. Oper. Res., 2005

System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion.
Operations Research, 2005

Coordination Mechanisms for Selfish Scheduling.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

On the Inefficiency of Equilibria in Congestion Games.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

New Old Algorithms for Stochastic Scheduling.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
Approximate Local Search in Combinatorial Optimization.
SIAM J. Comput., 2004

On-line scheduling to minimize average completion time revisited.
Oper. Res. Lett., 2004

Selfish Routing in Capacitated Networks.
Math. Oper. Res., 2004

Introduction.
Annals OR, 2004

Approximate local search in combinatorial optimization.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Single Machine Scheduling with Precedence Constraints: Extended Abstract.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003
Solving Project Scheduling Problems by Minimum Cut Computations.
Management Science, 2003

Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.
Combinatorica, 2003

Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

On the performance of user equilibria in traffic networks.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Transitive Packing: A Unifying Concept in Combinatorial Optimization.
SIAM Journal on Optimization, 2002

Scheduling Unrelated Machines by Randomized Rounding.
SIAM J. Discrete Math., 2002

Single Machine Scheduling with Release Dates.
SIAM J. Discrete Math., 2002

The Complexity of Generic Primal Algorithms for Solving General Integer Programs.
Math. Oper. Res., 2002

2001
On project scheduling with irregular starting time costs.
Oper. Res. Lett., 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
Approximation in stochastic scheduling: the power of LP-based priority policies.
J. ACM, 1999

On the Chvátal Rank of Polytopes in the 0/1 Cube.
Discrete Applied Mathematics, 1999

An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming.
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

Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems.
Proceedings of the Algorithms, 1999

1998
Switchbox Routing in VLSI Design: Closing the Complexity Gap.
Theor. Comput. Sci., 1998

Base polytopes of series-parallel posets: Linear description and optimization.
Math. Program., 1998

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem.
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

Facets of the Generalized Permutahedron of a Poset.
Discrete Applied Mathematics, 1997

Random-Based Scheduling: New Approximations and LP Lower Bounds.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria.
Proceedings of the Algorithms, 1997

1996
Switchbox Routing in VLSI Design: Closing the Complexity Gap.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

Transitive Packing.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Improved Scheduling Algorithms for Minsum Criteria.
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
The Permutahedron of Series-parallel Posets.
Discrete Applied Mathematics, 1995

Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

The Interval Order Polytope of a Digraph.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

0/1-Integer Programming: Optimization and Augmentation are Equivalent.
Proceedings of the Algorithms, 1995


  Loading...