Publications
A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
S Polyakovskiy, R M'Hallah
(2022), Vol. 299, pp. 104-117, European Journal of Operational Research, C1
Just-in-time two-dimensional bin packing
S Polyakovskiy, R M'Hallah
(2021), Vol. 102, Omega (United Kingdom), C1
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
S Polyakovskiy, R M'Hallah
(2018), Vol. 266, pp. 819-839, European journal of operational research, Amsterdam, The Netherlands, C1
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
The packing while traveling problem
S Polyakovskiy, F Neumann
(2017), Vol. 258, pp. 424-439, European journal of operational research, Amsterdam, The Netherlands, C1-1
Sustainable supply chain network design: A case of the wine industry in Australia
M Varsei, S Polyakovskiy
(2017), Vol. 66, pp. 236-247, Omega (United Kingdom), C1-1
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
Solving hard control problems in voting systems via integer programming
S Polyakovskiy, R Berghammer, F Neumann
(2016), Vol. 250, pp. 204-213, European journal of operational research, Amsterdam, The Netherlands, C1-1
The focus of attention problem
D Goossens, S Polyakovskiy, F Spieksma, G Woeginger
(2016), Vol. 74, pp. 559-573, Algorithmica, New York, N.Y., C1-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 multi-agent system for the weighted earliness tardiness parallel machine problem
S Polyakovskiy, R M'Hallah
(2014), Vol. 44, pp. 115-136, Computers and operations research, Amsterdam, The Netherlands, C1-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
The three-dimensional matching problem in Kalmanson matrices
S Polyakovskiy, F Spieksma, G Woeginger
(2013), Vol. 26, pp. 1-9, Journal of combinatorial optimization, New York, N.Y., C1-1
Between a rock and a hard place: the two-to-one assignment problem
D Goossens, S Polyakovskiy, F Spieksma, G Woeginger
(2012), Vol. 76, pp. 223-237, Mathematical methods of operations research, Berlin, Germany, C1-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 approximability of three-dimensional assignment problems with bottleneck objective
D Goossens, S Polyakovskiy, F Spieksma, G Woeginger
(2010), Vol. 4, pp. 7-16, OPTIMIZATION LETTERS, Berlin, Germany, C1-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 the two-dimensional guillotine bin packing problem
S Polyakovsky, R M'Hallah
(2009), Vol. 192, pp. 767-781, European journal of operational research, Amsterdam, The Netherlands, C1-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
Funded Projects at Deakin
Other Public Sector Funding
Timetabling solutions for defence
A/Prof Vicky Mak, Dr Ana Novak, Dr Vivian Nguyen, Dr Kristan Pash, Prof Terry Caelli, Prof Bill Moran, Mr Brendan Hill, Dr Sergey Polyakovskiy
DSTO Grant - Research - Defence Science & Technology Organisation
- 2018: $40,721
- 2017: $15,000
Industry and Other Funding
Machine Learning and Optimisation for Adaptive Traffic Vehicle Routing.
Dr Dhananjay Thiruvady, Dr Sutharshan Rajasegarar, Dr Sergey Polyakovskiy
CAT3-1 Premonition.io Pty Ltd
- 2021: $10,098
Supervisions
No completed student supervisions to report