Dr Sergey Polyakovskiy

A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem

S Polyakovskiy, P Stuckey

(2023), Vol. 33, pp. 352-360, ICAPS 2023 : Proceedings of the International Conference on Automated Planning and Scheduling, Prague, Czech Republic, E1

A Fully Polynomial Time Approximation Scheme for Packing While Traveling

F Neumann, S Polyakovskiy, M Skutella, L Stougie, J Wu

(2019), pp. 59-72, ALGOCLOUD 2018 : Algorithmic Aspects of Cloud Computing., Helsinki, Finland, E1

Evolutionary computation plus dynamic programming for the Bi-objective travelling thief problem

J Wu, M Wagner, S Polyakovskiy, F Neumann

(2018), pp. 777-784, GECCO 2018 : Proceedings of the 2018 Genetic and Evolutionary Computation Conference, Kyoto, Japan, E1

Just-in-time batch scheduling problem with two-dimensional bin packing constraints

S Polyakovskiy, A Makarowsky, R M'Hallah

(2017), pp. 321-328, GECCO 2017 - Proceedings of the 2017 Genetic and Evolutionary Computation Conference, Berlin, Germany, E1-1

Exact approaches for the travelling thief problem

J Wu, M Wagner, S Polyakovskiy, F Neumann

(2017), Vol. 10593, pp. 110-121, SEAL 2017 : Proceedings of the 11th International Conference on Simulated Evolution and Learning, Shenzhen, China, E1-1

On the impact of the renting rate for the unconstrained nonlinear Knapsack problem

J Wu, S Polyakovskiy, F Neumann

(2016), pp. 413-419, GECCO 2016 - Proceedings of the 2016 Genetic and Evolutionary Computation Conference, Denver, Colorado, E1-1

Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems

S Polyakovskiy, F Neumann

(2015), Vol. 9075, pp. 332-346, CPAIOR 2015 : Proceedings of the 12th International Conference on Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, Barcelona, Spain, E1-1

Approximate approaches to the traveling thief problem

H Faulkner, S Polyakovskiy, T Schultz, M Wagner

(2015), pp. 385-392, GECCO 2015 : Proceedings of the 2015 Genetic and Evolutionary Computation Conference, Madrid, Spain, E1-1

A comprehensive benchmark set and heuristics for the traveling thief problem

S Polyakovskiy, M Bonyadi, M Wagner, Z Michalewicz, F Neumann

(2014), pp. 477-484, GECCO 2014 - Proceedings of the 2014 Genetic and Evolutionary Computation Conference, Vancouver, Canada, E1-1

Between a rock and a hard place: the two-to-one assignment problem

D Goossens, S Polyakovskiy, F Spieksma, G Woeginger

(2012), Vol. 5893, pp. 159-169, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Copenhagen, Denmark, E1-1

An intelligent framework to online bin packing in a just-in-time environment

S Polyakovskiy, R M'Hallah

(2011), Vol. 6704 LNCS, pp. 226-236, Modern Approaches in Applied Intelligence. IEA/AIE 2011, Syracuse, N. Y., E1-1

The focus of attention problem

Dries Goossens, Sergey Polyakovskiy, Frits Spieksma, Gerhard Woeginger

(2010), Vol. 135, pp. 312-317, Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Austin, Texas, E1-1

An agent-based approach to knapsack optimization problems

Sergey Polyakovskiy, Rym M'Hallah

(2007), Vol. 4570, pp. 1098-1107, New Trends in Applied Artificial Intelligence. IEA/AIE 2007, Kyoto, Japan, E1-1