University Staff Directory The University of Adelaide Australia
Faculties & Divisions | People A to Z | Media Expertise | Phonebook
Public browsing [Login]
Text Zoom: S | M | L

Dr Sergey Polyakovskiy

Telephone +61 8 8313 4486
Position Postdoctoral Research Fellow
Email sergey.polyakovskiy@adelaide.edu.au
Fax +61 8 8313 4366
Building Ingkarni Wardli
Floor/Room 4 56
Campus North Terrace
Org Unit School of Computer Science

To link to this page, please use the following URL:
http://www.adelaide.edu.au/directory/sergey.polyakovskiy

Research Interests

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

Publications

Articles in refereed journals   
  1. M. Varsei, S. Polyakovskiy (2015): Sustainable supply chain network design: A case of the wine industry in Australia. Omega (to appear).
  2. S. Polyakovskiy, R. Berghammer, F. Neumann (2015): Solving Hard Control Problems in Voting Systems via Integer Programming. European Journal of Operational Research (to appear)
  3. D. Goossens, S. Polyakovskiy, F.C.R. Spieksma, G. Woeginger (2014): The focus of attention problem. Algorithmica, DOI 10.1007/s00453-014-9963-8, to appear.
  4. 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)
  5. 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.
  6. 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.
  7. 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.
  8. 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, 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.
  2. 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, to appear.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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.

Entry last updated: Monday, 23 Nov 2015

The information in this directory is provided to support the academic, administrative and business activities of the University of Adelaide. To facilitate these activities, entries in the University Phone Directory are not limited to University employees. The use of information provided here for any other purpose, including the sending of unsolicited commercial material via email or any other electronic format, is strictly prohibited. The University reserves the right to recover all costs incurred in the event of breach of this policy.