( en | de | ru )

 

Disambiguation of "Polyakovskiy, Sergey"

Author of the publication

copydeleteadd this publication to your clipboard
A Fully Polynomial Time Approximation Scheme for Packing While Traveling.

, , , , and . ALGOCLOUD, volume 11409 of Lecture Notes in Computer Science, page 59-72. Springer, (2018)

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.

Sergey Stepanov

Sergey Gorbunov

Sergey Libert

Sergey Oladyshkin

Sergey Alatartsev

 

Other publications of authors with the same name

The Focus of Attention Problem., , , and . SODA, page 312-317. SIAM, (2010)Between a rock and a hard place: the two-to-one assignment problem., , , and . Math. Methods Oper. Res., 76 (2): 223-237 (2012)A Fully Polynomial Time Approximation Scheme for Packing While Traveling., , , , and . ALGOCLOUD, volume 11409 of Lecture Notes in Computer Science, page 59-72. Springer, (2018)Just-in-time batch scheduling subject to batch size., , and . GECCO, page 228-235. ACM, (2020)Between a Rock and a Hard Place: The Two-to-One Assignment Problem., , , and . WAOA, volume 5893 of Lecture Notes in Computer Science, page 159-169. Springer, (2009)The approximability of three-dimensional assignment problems with bottleneck objective., , , and . Optim. Lett., 4 (1): 7-16 (2010)A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem., and . ICAPS, page 352-360. AAAI Press, (2023)Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System., and . OR, page 417-422. Springer, (2012)Just-in-time batch scheduling problem with two-dimensional bin packing constraints., , and . GECCO, page 321-328. ACM, (2017)Approximate Approaches to the Traveling Thief Problem., , , and . GECCO, page 385-392. ACM, (2015)