Sustainable supply chain network design: A case of the wine industry in Australia M Varsei, S Polyakovskiy Omega 66, 236-247, 2017 | 125 | 2017 |

A comprehensive benchmark set and heuristics for the traveling thief problem S Polyakovskiy, MR Bonyadi, M Wagner, Z Michalewicz, F Neumann Proceedings of the 2014 Annual Conference on Genetic and Evolutionary …, 2014 | 84 | 2014 |

An agent-based approach to the two-dimensional guillotine bin packing problem S Polyakovsky, R M’Hallah European Journal of Operational Research 192 (3), 767-781, 2009 | 58 | 2009 |

Approximate approaches to the traveling thief problem H Faulkner, S Polyakovskiy, T Schultz, M Wagner Proceedings of the 2015 Annual Conference on Genetic and Evolutionary …, 2015 | 48 | 2015 |

A multi-agent system for the weighted earliness tardiness parallel machine problem S Polyakovskiy, R M'Hallah Computers & Operations Research 44, 115-136, 2014 | 22 | 2014 |

Exact approaches for the travelling thief problem J Wu, M Wagner, S Polyakovskiy, F Neumann Asia-Pacific Conference on Simulated Evolution and Learning, 110-121, 2017 | 18 | 2017 |

Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem J Wu, S Polyakovskiy, M Wagner, F Neumann Proceedings of the Genetic and Evolutionary Computation Conference, 777-784, 2018 | 17 | 2018 |

Packing while traveling: Mixed integer programming for a class of nonlinear knapsack problems S Polyakovskiy, F Neumann International Conference on AI and OR Techniques in Constriant Programming …, 2015 | 15 | 2015 |

A fully polynomial time approximation scheme for packing while traveling F Neumann, S Polyakovskiy, M Skutella, L Stougie, J Wu International Symposium on Algorithmic Aspects of Cloud Computing, 59-72, 2018 | 14 | 2018 |

On the impact of the renting rate for the unconstrained nonlinear knapsack problem J Wu, S Polyakovskiy, F Neumann Proceedings of the Genetic and Evolutionary Computation Conference 2016, 413-419, 2016 | 14 | 2016 |

A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates S Polyakovskiy, R M’Hallah European Journal of Operational Research 266 (3), 819-839, 2018 | 12 | 2018 |

The packing while traveling problem S Polyakovskiy, F Neumann European Journal of Operational Research 258 (2), 424-439, 2017 | 12 | 2017 |

The approximability of three-dimensional assignment problems with bottleneck objective D Goossens, S Polyakovskiy, FCR Spieksma, GJ Woeginger Optimization Letters 4 (1), 7-16, 2010 | 11 | 2010 |

The three-dimensional matching problem in Kalmanson matrices S Polyakovskiy, FCR Spieksma, GJ Woeginger Journal of Combinatorial Optimization 26 (1), 1-9, 2013 | 9 | 2013 |

Just-in-time batch scheduling problem with two-dimensional bin packing constraints S Polyakovskiy, A Makarowsky, R M'Hallah Proceedings of the Genetic and Evolutionary Computation Conference, 321-328, 2017 | 6 | 2017 |

Solving hard control problems in voting systems via integer programming S Polyakovskiy, R Berghammer, F Neumann European Journal of Operational Research 250 (1), 204-213, 2016 | 6 | 2016 |

Between a rock and a hard place: the two-to-one assignment problem D Goossens, S Polyakovskiy, FCR Spieksma, GJ Woeginger Mathematical methods of operations research 76 (2), 223-237, 2012 | 6 | 2012 |

Between a rock and a hard place: the two-to-one assignment problem D Goossens, S Polyakovskiy, FCR Spieksma, GJ Woeginger Mathematical methods of operations research 76 (2), 223-237, 2012 | 6 | 2012 |

An agent-based approach to knapsack optimization problems S Polyakovsky, R M’Hallah International Conference on Industrial, Engineering and Other Applications …, 2007 | 5 | 2007 |

An intelligent framework to online bin packing in a just-in-time environment S Polyakovskiy, R M’Hallah International Conference on Industrial, Engineering and Other Applications …, 2011 | 4 | 2011 |