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
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)

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

The Permutahedron of Series-parallel Posets.. Discrete Applied Mathematics, 57 (1): 85-90 (1995)Robust Monotone Submodular Function Maximization., , and . CoRR, (2015)Robust monotone submodular function maximization., , and . Math. Program., 172 (1-2): 505-537 (2018)Approximate Local Search in Combinatorial Optimization., , and . SIAM J. Comput., 33 (5): 1201-1214 (2004)On the Inefficiency of Equilibria in Congestion Games., , and . IPCO, volume 3509 of Lecture Notes in Computer Science, page 167-181. Springer, (2005)The Interval Order Polytope of a Digraph., and . IPCO, volume 920 of Lecture Notes in Computer Science, page 50-64. Springer, (1995)Transitive Packing., and . IPCO, volume 1084 of Lecture Notes in Computer Science, page 430-444. Springer, (1996)On the Rank of Cutting-Plane Proof Systems., and . IPCO, volume 6080 of Lecture Notes in Computer Science, page 450-463. Springer, (2010)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)Random-Based Scheduling: New Approximations and LP Lower Bounds., and . RANDOM, volume 1269 of Lecture Notes in Computer Science, page 119-133. Springer, (1997)