( en | de | ru )

 

Disambiguation of "Schulz, Andreas S."

Author of the publication

copydeleteadd this publication to your clipboard
Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank.

, and . Oper. Res. Lett., 39 (6): 457-460 (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

On the complexity of recognizing integrality and total dual integrality of the 0, 1/2-closure., and . Oper. Res. Lett., 50 (1): 16-19 (2022)Sharing Supermodular Costs., and . Operations Research, 58 (4-Part-2): 1051-1056 (2010)Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard., and . CoRR, (2020)On the Complexity of Recognizing Integrality and Total Dual Integrality of the 0, 1/2-Closure., and . CoRR, (2021)The Competitive Pickup and Delivery Orienteering Problem for Balancing Car-Sharing Systems., , , and . Transp. Sci., 55 (6): 1232-1259 (2021)Precedence-Constrained Scheduling and Min-Sum Set Cover., and . WAOA, volume 11926 of Lecture Notes in Computer Science, page 170-187. Springer, (2019)On the membership problem for the 0, 1/2-closure., , and . Oper. Res. Lett., 39 (5): 301-304 (2011)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)