Andreas S. Schulz

Claudio Telha

Proceedings of the Algorithms - ESA 2011, 2011

2010

Minimizing the sum of weighted completion times in a concurrent open shop.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

Sharing Supermodular Costs.

[BibT_eX]

[DOI]

Nelson A. Uhan

Oper. Res., 2010

On the Rank of Cutting-Plane Proof Systems.

[BibT_eX]

[DOI]

Sebastian Pokutta

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

Coordination mechanisms for selfish scheduling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Integer equal flows.

[BibT_eX]

[DOI]

Carol A. Meyers

Oper. Res. Lett., 2009

Integer Programming: Optimization and Evaluation Are Equivalent.

[BibT_eX]

[DOI]

Abraham P. Punnen

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.

[BibT_eX]

[DOI]

Juliane Dunkel

Math. Oper. Res., 2008

A geometric approach to the price of anarchy in nonatomic congestion games.

[BibT_eX]

[DOI]

Games Econ. Behav., 2008

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

[BibT_eX]

[DOI]

Sudipta Sengupta

Discret. Optim., 2008

Stochastic Online Scheduling Revisited.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007

Fast, Fair, and Efficient Flows in Networks.

[BibT_eX]

[DOI]

Oper. Res., 2007

Encouraging Cooperation in Sharing Supermodular Costs.

[BibT_eX]

[DOI]

Nelson A. Uhan

Proceedings of the Approximation, 2007

2006

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.

[BibT_eX]

[DOI]

Maurice Queyranne

SIAM J. Comput., 2006

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

[BibT_eX]

[DOI]

Networks, 2006

2005

Single-Machine Scheduling with Precedence Constraints.

[BibT_eX]

[DOI]

Math. Oper. Res., 2005

System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion.

[BibT_eX]

[DOI]

Olaf Jahn

Oper. Res., 2005

On the Inefficiency of Equilibria in Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

New Old Algorithms for Stochastic Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004

Approximate Local Search in Combinatorial Optimization.

[BibT_eX]

[DOI]

Abraham P. Punnen

SIAM J. Comput., 2004

On-line scheduling to minimize average completion time revisited.

[BibT_eX]

[DOI]

Nicole Megow

Oper. Res. Lett., 2004

Selfish Routing in Capacitated Networks.

[BibT_eX]

[DOI]

Math. Oper. Res., 2004

Introduction.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2004

Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Single Machine Scheduling with Precedence Constraints: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

Solving Project Scheduling Problems by Minimum Cut Computations.

[BibT_eX]

[DOI]

Manag. Sci., 2003

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

[BibT_eX]

[DOI]

Friedrich Eisenbrand

Comb., 2003

Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms.

[BibT_eX]

[DOI]

Nicole Megow

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

On the performance of user equilibria in traffic networks.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Transitive Packing: A Unifying Concept in Combinatorial Optimization.

[BibT_eX]

[DOI]

Rudolf Müller

SIAM J. Optim., 2002

Scheduling Unrelated Machines by Randomized Rounding.

[BibT_eX]

[DOI]

Martin Skutella

SIAM J. Discret. Math., 2002

Single Machine Scheduling with Release Dates.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

The Complexity of Generic Primal Algorithms for Solving General Integer Programs.

[BibT_eX]

[DOI]

Robert Weismantel

Math. Oper. Res., 2002

2001

On project scheduling with irregular starting time costs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2001

2000

epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract).

[BibT_eX]

[DOI]

Sudipta Sengupta

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.

[BibT_eX]

[DOI]

Marc Uetz

J. ACM, 1999

On the Chvátal Rank of Polytopes in the 0/1 Cube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming.

[BibT_eX]

[DOI]

Robert Weismantel

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies.

[BibT_eX]

[DOI]

Marc Uetz

Proceedings of the Randomization, 1999

Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

Switchbox Routing in VLSI Design: Closing the Complexity Gap.

[BibT_eX]

[DOI]

Stephan Hartmann

Markus W. Schäffter

Theor. Comput. Sci., 1998

Base polytopes of series-parallel posets: Linear description and optimization.

[BibT_eX]

[DOI]

Rainer Schrader

Georg Wambach

Math. Program., 1998

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 1998

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.

[BibT_eX]

[DOI]

Alix Munier

Maurice Queyranne

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms.

[BibT_eX]

[DOI]

Math. Oper. Res., 1997

Facets of the Generalized Permutahedron of a Poset.

[BibT_eX]

[DOI]

Annelie von Arnim

Discret. Appl. Math., 1997

Random-Based Scheduling: New Approximations and LP Lower Bounds.

[BibT_eX]

[DOI]

Martin Skutella

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria.

[BibT_eX]

[DOI]

Martin Skutella

Proceedings of the Algorithms, 1997

1996

Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Transitive Packing.

[BibT_eX]

[DOI]

Rudolf Müller

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Improved Scheduling Algorithms for Minsum Criteria.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract).

[BibT_eX]

[DOI]

Markus W. Schäffter

Proceedings of the Algorithms, 1996

1995

The Permutahedron of Series-parallel Posets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds.

[BibT_eX]

[DOI]

Maurice Queyranne

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

The Interval Order Polytope of a Digraph.

[BibT_eX]

[DOI]

Rudolf Müller

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

0/1-Integer Programming: Optimization and Augmentation are Equivalent.

[BibT_eX]

[DOI]