( en | de | ru )

 

Disambiguation of "Sviridenko, Maxim"

Author of the publication

copydeleteadd this publication to your clipboard
High-multiplicity cyclic job shop scheduling.

, and . Oper. Res. Lett., 36 (5): 574-578 (2008)

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.

Petru Joan Maxim

Angela Maximini

Adel Maximos

Alexander Maximov

Maria Maxim

 

Other publications of authors with the same name

An Algorithm for Online K-Means Clustering., , and . ALENEX, page 81-89. SIAM, (2016)Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs., , , , , and . ACM Trans. Algorithms, 4 (3): 34:1-34:17 (2008)Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines., and . IPCO, volume 7801 of Lecture Notes in Computer Science, page 387-398. Springer, (2013)Concentration and moment inequalities for polynomials of independent random variables., and . SODA, page 437-446. SIAM, (2012)TSI: An Ad Text Strength Indicator using Text-to-CTR and Semantic-Ad-Similarity., , , , , and . CIKM, page 4036-4045. ACM, (2021)Min Sum Edge Coloring in Multigraphs Via Configuration LP., , and . IPCO, volume 5035 of Lecture Notes in Computer Science, page 359-373. Springer, (2008)An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.. IPCO, volume 2337 of Lecture Notes in Computer Science, page 240-257. Springer, (2002)No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem., and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 769-779. Springer, (2013)Integrated Supply Chain Management via Randomized Rounding., and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 562-573. Springer, (2014)Approximating the minimum quadratic assignment problems., , and . ACM Trans. Algorithms, 6 (1): 18:1-18:10 (2009)