Dr Sergey Polyakovskiy

Sergey Polyakovskiy
Lecturer
School of Computer Science
Faculty of Engineering, Computer and Mathematical Sciences

Connect with me

Dr Sergey Polyakovskiy

  • Combinatorial Optimization
  • Mathematical & Constrained Programming
  • Hybrid and Decomposition-Based Optimization Approaches
  • Industrial Applications
  • Multi-Component Combinatorial Optimization Problems

Education

Date Institution name Country Title
2006 - 2010 Ufa State Aviation Technical University, Ufa Russia PhD

Journals

Year Citation
2017 Varsei, M. & Polyakovskiy, S. (2017). Sustainable supply chain network design: a case of the wine industry in Australia. Omega, 66, Part B, 236-247.
10.1016/j.omega.2015.11.009
2017 Polyakovskiy, S. & Neumann, F. (2017). The Packing While Traveling Problem. European Journal of Operational Research, 258, 2, 424-439.
10.1016/j.ejor.2016.09.035
2016 Goossens, D., Polyakovskiy, S., Spieksma, F. C. R. & Woeginger, G. J. (2016). The Focus of Attention Problem. Algorithmica, 74, 2, 559-573.
10.1007/s00453-014-9963-8
2016 Polyakovskiy, S., Berghammer, R. & Neumann, F. (2016). Solving hard control problems in voting systems via integer programming. European Journal of Operational Research, 250, 1, 204-213.
10.1016/j.ejor.2015.08.052
2014 Polyakovskiy, S. & M'Hallah, R. (2014). A multi-agent system for the weighted earliness tardiness parallel machine problem. Computers & Operations Research, 44, 115-136.
10.1016/j.cor.2013.10.013
2013 Polyakovskiy, S., Spieksma, F. & Woeginger, G. (2013). The three-dimensional matching problem in Kalmanson matrices. Journal of Combinatorial Optimization, 26, 1, 1-9.
10.1007/s10878-011-9426-y
2012 Goossens, D., Polyakovskiy, S., Spieksma, F. & Woeginger, G. (2012). Between a rock and a hard place: the two-to-one assignment problem. Mathematical Methods of Operations Research, 76, 2, 223-237.
10.1007/s00186-012-0397-2
2010 Goossens, D., Polyakovskiy, S., Spieksma, F. & Woeginger, G. (2010). The approximability of three-dimensional assignment problems with bottleneck objective. Optimization Letters, 4, 1, 7-16.
10.1007/s11590-009-0152-7
2009 Polyakovsky, S. & M’Hallah, R. (2009). An agent-based approach to the two-dimensional guillotine bin packing problem. European Journal of Operational Research, 192, 3, 767-781.
10.1016/j.ejor.2007.10.020

Conference Papers

Year Citation
2017 Polyakovskiy, S., Makarowsky, A. & M'Hallah, R. (2017). Just-in-time batch scheduling problem with two-dimensional bin packing constraints.
10.1145/3071178.3071223
2016 Wu, J., Polyakovskiy, S. & Neumann, F. (2016). On the impact of the renting rate for the unconstrained nonlinear Knapsack problem. Genetic and Evolutionary Computation Conference (GECCO). Denver, CO.
10.1145/2908812.2908862
2015 Faulkner, H., Polyakovskiy, S., Schultz, T. & Wagner, M. (2015). Approximate approaches to the traveling thief problem. 2015 Annual Conference on Genetic and Evolutionary Computation (GECCO '15). Madrid, Spain.
10.1145/2739480.2754716
2015 Polyakovskiy, S. & Neumann, F. (2015). Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems. 12th International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming (CPAIOR). L. Michel (Ed.) Barcelona, Spain.
10.1007/978-3-319-18008-3_23
2014 Polyakovskiy, S., Bonyadi, M. R., Wagner, M., Michalewicz, Z. & Neumann, F. (2014). A comprehensive benchmark set and heuristics for the traveling thief problem. 2014 Genetic and Evolutionary Computation Conference (GECCO 2014). Vancouver, Canada.
10.1145/2576768.2598249
2014 Polyakovskiy, S. & M'Hallah, R. (2014). Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent
System. International Annual conference of the German Operations Research Society. S Helber, M Breitner, D Rosch, C Schon, J_M Graf von der Schulenburg, P Sibbertsen ... A Wolter (Eds.) Hannover, Germany.
2011 Polyakovskiy, S. & M'Hallah, R. (2011). An intelligent framework to online bin packing in a just-in-time environment. International conference on industrial engineering and other applications of applied intelligent systems. K. G. Mehrotra, C. K. Mohan, J. C. Oh, P. K. Varshney & A. Moonis (Eds.) Syracuse, New York.
10.1007/978-3-642-21827-9_23
2010 Goossens, D., Polyakovskiy, S., Spieksma, F. C. R. & Woeginger, G. J. (2010). The focus of attention problem. 21st Annual ACM-SIAM Symposium on Discrete Algorithms. Austin, TX.
2010 Goossens, D., Polyakovskiy, S., Spieksma, F. C. R. & Woeginger, G. J. (2010). Between a rock and a hard place: the two-to-one assignment problem. 7th International Workshop on Approximation and Online Algorithms. E. Bampis & K. Jansen (Eds.) Copenhagen, Denmark.
10.1007/978-3-642-12450-1_15
2007 Polyakovsky, S. & M'Hallah, R. (2007). An agent-based approach to knapsack optimization problems.
  • Systems Programming in C, semester 1, 2017.
  • Object-Oriented Programming, semester 1, 2017.
  • Object-Oriented Programming (Small Group Discovery Experience), semester 1, 2017.
  • Event-Driven Computing, semester 2, 2016.
  • Object-Oriented Programming, semester 2, 2016.
  • Object-Oriented Programming (Small Group Discovery Experience), semester 2, 2016.
  • Algorithm and Data Structure Analysis, semester 2, 2016.
  • Object-Oriented Programming, semester 1, 2016.
  • Parallel and Distributed Computing, semester 1, 2016.
  • Masters of Computer and Innovation Project, semester 1, 2015.
  • Algorithm and Data Structure Analysis, semester 2, 2014.
Position
Lecturer
Phone
83134486
Fax
8313 4366
Campus
North Terrace
Building
Ingkarni Wardli Building
Room Number
4 56
Org Unit
School of Computer Science

top