( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Total Completion Time Minimization for Scheduling with Incompatibility Cliques.

, , , и . CoRR, (2020)

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.

Antje Lassota

Andreas Lassota

Alexandra Müller

Identifizierung eisenreduzierender Mikroorganismen in anoxischem Reisfeldboden mit Hilfe stabiler Isotope. Uni Marburg, (2009)

Alexandra Fies

Die badische Auswanderung im 19. Jahrhundert nach Nordamerika unter besonderer Berücksichtigung des Amtsbezirks Karlsruhe zwischen 1880 - 1914. Uni Karlsruhe, (2009)

Alexandra Kaupisch

Biochemische und Zellbiologische Charakterisierung der humanen Proteinkinase X. Uni Kassel, (2008)
 

Другие публикации лиц с тем же именем

Tight Lower Bounds for Block-Structured Integer Programs., , , , и . IPCO, том 14679 из Lecture Notes in Computer Science, стр. 224-237. Springer, (2024)The double exponential runtime is tight for 2-stage stochastic ILPs., , и . Math. Program., 197 (2): 1145-1172 (февраля 2023)Total Completion Time Minimization for Scheduling with Incompatibility Cliques., , , и . ICAPS, стр. 192-200. AAAI Press, (2021)Cardinality Constrained Scheduling in Online Models., , , , и . STACS, том 219 из LIPIcs, стр. 28:1-28:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs., , и . SOFSEM, том 12607 из Lecture Notes in Computer Science, стр. 349-360. Springer, (2021)Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard., , , , и . SOSA, стр. 279-285. SIAM, (2024)Total Completion Time Minimization for Scheduling with Incompatibility Cliques., , , и . CoRR, (2020)Online cardinality constrained scheduling., , , , и . Oper. Res. Lett., 51 (5): 533-539 (сентября 2023)Approximation Algorithms for Scheduling with Class Constraints., , и . SPAA, стр. 349-357. ACM, (2020)The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs., , и . IPCO, том 12707 из Lecture Notes in Computer Science, стр. 297-310. Springer, (2021)