( en | de | ru )

 

Disambiguation of "Schulz, Andreas S."

Author of the publication

copydeleteadd this publication to your clipboard
Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands.

, and . ESA, volume 6942 of Lecture Notes in Computer Science, page 628-639. Springer, (2011)

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

Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands., and . ESA, volume 6942 of Lecture Notes in Computer Science, page 628-639. Springer, (2011)Stochastic Online Scheduling Revisited.. COCOA, volume 5165 of Lecture Notes in Computer Science, page 448-457. Springer, (2008)Robust Monotone Submodular Function Maximization., , and . IPCO, volume 9682 of Lecture Notes in Computer Science, page 312-324. Springer, (2016)Single Machine Scheduling with Precedence Constraints: Extended Abstract., and . IPCO, volume 3064 of Lecture Notes in Computer Science, page 283-297. Springer, (2004)The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope., and . Math. Oper. Res., 38 (1): 63-91 (2013)Precedence-Constrained Scheduling and Min-Sum Set Cover., and . WAOA, volume 11926 of Lecture Notes in Computer Science, page 170-187. Springer, (2019)A geometric approach to the price of anarchy in nonatomic congestion games., , and . Games Econ. Behav., 64 (2): 457-469 (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)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)