Sergey Polyakovskiy

According to our database, Sergey Polyakovskiy authored at least 23 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem.

Sergey Polyakovskiy, Peter J. Stuckey

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022

A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem.

Sergey Polyakovskiy, Rym M'Hallah

Eur. J. Oper. Res., 2022

2020

Just-in-time batch scheduling subject to batch size.

Sergey Polyakovskiy, Dhananjay R. Thiruvady, Rym M'Hallah

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2018

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

Sergey Polyakovskiy, Rym M'Hallah

Eur. J. Oper. Res., 2018

Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem.

Junhua Wu, Sergey Polyakovskiy, Markus Wagner, Frank Neumann

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

A Fully Polynomial Time Approximation Scheme for Packing While Traveling.

Frank Neumann, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, Junhua Wu

Proceedings of the Algorithmic Aspects of Cloud Computing - 4th International Symposium, 2018

2017

The Packing While Traveling Problem.

Sergey Polyakovskiy, Frank Neumann

Eur. J. Oper. Res., 2017

Exact Approaches for the Travelling Thief Problem.

Junhua Wu, Markus Wagner, Sergey Polyakovskiy, Frank Neumann

Proceedings of the Simulated Evolution and Learning - 11th International Conference, 2017

Just-in-time batch scheduling problem with two-dimensional bin packing constraints.

Sergey Polyakovskiy, Alexander Makarowsky, Rym M'Hallah

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016

Solving hard control problems in voting systems via integer programming.

Sergey Polyakovskiy, Rudolf Berghammer, Frank Neumann

Eur. J. Oper. Res., 2016

The Focus of Attention Problem.

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger

Algorithmica, 2016

On the Impact of the Renting Rate for the Unconstrained Nonlinear Knapsack Problem.

Junhua Wu, Sergey Polyakovskiy, Frank Neumann

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

2015

Approximate Approaches to the Traveling Thief Problem.

Hayden Faulkner, Sergey Polyakovskiy, Tom Schultz, Markus Wagner

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems.

Sergey Polyakovskiy, Frank Neumann

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014

A multi-agent system for the weighted earliness tardiness parallel machine problem.

Sergey Polyakovskiy, Rym M'Hallah

Comput. Oper. Res., 2014

A comprehensive benchmark set and heuristics for the traveling thief problem.

Sergey Polyakovskiy, Mohammad Reza Bonyadi, Markus Wagner, Zbigniew Michalewicz, Frank Neumann

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013

The three-dimensional matching problem in Kalmanson matrices.

Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger

J. Comb. Optim., 2013

2012

Between a rock and a hard place: the two-to-one assignment problem.

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger

Math. Methods Oper. Res., 2012

Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System.

Sergey Polyakovskiy, Rym M'Hallah

Proceedings of the Operations Research Proceedings 2012, 2012

2011

An Intelligent Framework to Online Bin Packing in a Just-In-Time Environment.

Sergey Polyakovsky, Rym M'Hallah

Proceedings of the Modern Approaches in Applied Intelligence, 2011

2010

The approximability of three-dimensional assignment problems with bottleneck objective.

Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger

Optim. Lett., 2010

2009

An agent-based approach to the two-dimensional guillotine bin packing problem.

Sergey Polyakovsky, Rym M'Hallah

Eur. J. Oper. Res., 2009

2007

An Agent-Based Approach to Knapsack Optimization Problems.

Sergey Polyakovsky, Rym M'Hallah

Proceedings of the New Trends in Applied Artificial Intelligence, 2007