Dr. Sergey Polyakovskiy
  • Combinatorial Optimization
  • Mathematical & Constrained Programming
  • Hybrid and Decomposition-Based Optimization Approaches
  • Industrial Applications
  • Multi-Component Combinatorial 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. (SELT-UG, SELT-PG)
  • Object-Oriented Programming, semester 2, 2016. (SELT)
  • Object-Oriented Programming (Small Group Discovery Experience), semester 2, 2016.
  • Algorithm and Data Structure Analysis, semester 2, 2016. (SELT-UG, SELT-PG)
  • 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.
Articles in refereed journals
  1. S. Polyakovskiy, F. Neumann (2017): The Packing While Traveling Problem. European Journal of Operational Research, volume 258, pages 424–439.
  2. M. Varsei, S. Polyakovskiy (2017): Sustainable supply chain network design: A case of the wine industry in Australia. Omega, volume 66, pages 236–247.
  3. S. Polyakovskiy, R. Berghammer, F. Neumann (2016): Solving Hard Control Problems in Voting Systems via Integer Programming. European Journal of Operational Research, volume 250, pages 204–213.
  4. D. Goossens, S. Polyakovskiy, F.C.R. Spieksma, G. Woeginger (2016): The focus of attention problem. Algorithmica, volume 74(2), pages 559-573.
  5. S. Polyakovskiy, R. M’Hallah (2014): A multi-agent system for the weighted earliness tardiness parallel machine problem. Computers & Operations Research, volume 44, pages 115-136. (Test Instances and Results)
  6. S. Polyakovskiy, F. C. R. Spieksma, G. J. Woeginger (2013): The three-dimensional matching problem in Kalmanson matrices. Journal of Combinatorial Optimization, volume 26, issue 1, pages 1-9.
  7. D. Goossens, S. Polyakovskiy, F. Spieksma, G. Woeginger (2012): Between a rock and a hard place: the two-to-one assignment problem. Mathematical Methods of Operations Research, volume 76, issue 2, pages 223-237.
  8. D. Goossens, S. Polyakovskiy, F. Spieksma, G. Woeginger (2010): The approximability of three-dimensional assignment problems with bottleneck objective. Optimization Letters, volume 4, issue 1, pages 7 - 16.
  9. S. Polyakovsky, R. M’Hallah (2009): An agent-based approach to the two-dimensional guillotine bin packing problem. European Journal of Operational Research, volume 192, issue 3, pages 767-781.
Articles in refereed conference proceedings
  1. S. Polyakovskiy, A. Makarowsky, R. M’Hallah (2017): Just-in-Time Batch Scheduling Problem with Two-dimensional Bin Packing Constraints. In: GECCO '17 Proceedings of the 2016 Conference on Genetic and Evolutionary Computation, ACM Press, accepted for publication.
  2. J. Wu, S. Polyakovskiy, F. Neumann (2016): On the Impact of the Renting Rate for the Unconstrained Nonlinear Knap-sack Problem. In: GECCO '16 Proceedings of the 2016 Conference on Genetic and Evolutionary Computation, ACM Press, pages 413-419 (nominated for Best Paper Award).
  3. S. Polyakovskiy, F. Neumann (2015): Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems. In: Proceedings of the Twelfth International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR 2015), LNCS, volume 9075, pages 332-346.
  4. H. Falkner, S. Polyakovskiy, T. Schultz, M. Wagner (2015): Approximate Approaches to the Traveling Thief Problem. In: GECCO '15 Proceedings of the 2015 Conference on Genetic and Evolutionary Computation, ACM Press, pages 385-392.
  5. S. Polyakovsky, M. Bonyadi, M. Wagner, F. Neumann, Z. Michalewicz (2014): A comprehensive benchmark set and heuristics for the travelling thief problem. In: GECCO '14 Proceedings of the 2014 Conference on Genetic and Evolutionary Computation, ACM Press, pages 477-484.
  6. S. Polyakovskiy, R. M'Hallah (2014): Minimizing weighted earliness and tardiness on parallel machines using a multi-agent system. In: Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), Operations Research Proceedings 2012, Springer, pages 417-422.
  7. S. Polyakovskiy, R. M'Hallah (2011): An intelligent framework to online bin packing in a just-in-time environment. In: Modern Approaches in Applied Intelligence, 24th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2011, LNCS 6704, Springer, issue 2, pages 226-236.
  8. D. Goossens, S. Polyakovskiy, F.C.R. Spieksma, G. Woeginger (2010): The focus of attention problem. In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'10, SIAM, pages 312-317.
  9. D. Goossens, S. Polyakovskiy, F. Spieksma, G. Woeginger (2009): Between a rock and a hard place: the two-to-one assignment problem. In: 7th Workshop on Approximation and Online Algorithms, WAOA 2009, LNCS, volume 5893, pages 159 - 169.
  10. S. Polyakovsky, R. M’Hallah (2007): An agent-based approach to knapsack optimization problems. In: New Trends in Applied Artificial Intelligence, 20th International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2007, LNCS 4570, Springer, pages 1098-1107.