PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Schulz, Andreas S."

Author of the publication

copydeleteadd this publication to your clipboard
Approximate Local Search in Combinatorial Optimization.

, , and . SIAM J. Comput., 33 (5): 1201-1214 (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dr. Andreas Schulz University of Stuttgart

Dr. Heiko Schulz University of Stuttgart

S. Schumann

S. Seemann

Christoph Schulz University of Stuttgart

 

Other publications of authors with the same name

A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One., and . Operations Research, 61 (2): 386-397 (2013)Introduction., , , and . Annals OR, 129 (1-4): 17-19 (2004)Transitive Packing: A Unifying Concept in Combinatorial Optimization., and . SIAM Journal on Optimization, 13 (2): 335-367 (2002)The Permutahedron of Series-parallel Posets.. Discrete Applied Mathematics, 57 (1): 85-90 (1995)Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem., , , , and . J. Comb. Optim., 1 (4): 413-426 (1998)On project scheduling with irregular starting time costs., , , and . Oper. Res. Lett., 28 (4): 149-154 (2001)On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games., and . Math. Oper. Res., 33 (4): 851-868 (2008)The Price of Anarchy of the Proportional Allocation Mechanism Revisited., , and . WINE, volume 8289 of Lecture Notes in Computer Science, page 109-120. Springer, (2013)Improved Scheduling Algorithms for Minsum Criteria., , , , , and . ICALP, volume 1099 of Lecture Notes in Computer Science, page 646-657. Springer, (1996)Random-Based Scheduling: New Approximations and LP Lower Bounds., and . RANDOM, volume 1269 of Lecture Notes in Computer Science, page 119-133. Springer, (1997)