Profile image of Sergey Polyakovskiy

Dr Sergey Polyakovskiy

STAFF PROFILE

Position

Lecturer in Computer Science

Faculty

Faculty of Sci Eng & Built Env

Department

School of Info Technology

Campus

Melbourne Burwood Campus

Contact

Publications

Filter by

2020

Just-in-time two-dimensional bin packing

S Polyakovskiy, R M'Hallah

(2020), pp. 1-18, Omega, Amsterdam, The Netherlands, C1

journal article

Just-in-time batch scheduling subject to batch size

Sergey Polyakovskiy, Dhananjay Thiruvady, Rym M'Hallah

(2020), pp. 228-235, GECCO 2020 : Proceedings of the 2020 Genetic and Evolutionary Computation Conference, Cancun, Mexico, E1

conference
2018

A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates

S Polyakovskiy, R M'Hallah

(2018), Vol. 266, pp. 819-839, European journal of operational research, Amsterdam, The Netherlands, C1

journal article

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

conference
2017

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

journal article

Sustainable supply chain network design: a case of the wine industry in Australia

M Varsei, S Polyakovskiy

(2017), Vol. 66, pp. 236-247, Omega, Amsterdam, The Netherlands, C1-1

journal article

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

conference

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

conference
2016

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

journal article

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

journal article

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

conference
2015

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

conference

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

conference
2014

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

journal article
2013

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

journal article
2012

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

journal article

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

conference
2010

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

journal article
2009

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

journal article

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

  • 2018: $40,721
  • 2017: $15,000

Supervisions

No completed student supervisions to report