( en | de | ru )

 

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.

Andreas S Schulz

Andreas S Wirth

Andreas S Lübbe

Andreas S Kolb

Andreas Schulz

 

Other publications of authors with the same name

Robust Monotone Submodular Function Maximization., , and . CoRR, (2015)Robust monotone submodular function maximization., , and . Math. Program., 172 (1-2): 505-537 (2018)Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms., and . WAOA, volume 2909 of Lecture Notes in Computer Science, page 227-234. Springer, (2003)On the Rank of Cutting-Plane Proof Systems., and . IPCO, volume 6080 of Lecture Notes in Computer Science, page 450-463. Springer, (2010)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)Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies., , and . RANDOM-APPROX, volume 1671 of Lecture Notes in Computer Science, page 144-155. Springer, (1999)Random-Based Scheduling: New Approximations and LP Lower Bounds., and . RANDOM, volume 1269 of Lecture Notes in Computer Science, page 119-133. Springer, (1997)Introduction., , , and . Ann. Oper. Res., 129 (1-4): 17-19 (2004)Approximate Local Search in Combinatorial Optimization., , and . SIAM J. Comput., 33 (5): 1201-1214 (2004)