An Agent-Based Approach to Knapsack Optimization Problems. - Sergey Polyakovsky; Rym M'Hallah (IEA/AIE, 2007)

An agent-based approach to the two-dimensional guillotine bin packing problem. - Sergey Polyakovsky; Rym M'Hallah (Eur. J. Oper. Res., 2009)

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)

An Intelligent Framework to Online Bin Packing in a Just-In-Time Environment. - Sergey Polyakovsky; Rym M'Hallah (IEA/AIE (2), 2011)

Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System. - Sergey Polyakovskiy; Rym M'Hallah (OR, 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)

The three-dimensional matching problem in Kalmanson matrices. - Sergey Polyakovskiy; Frits C. R. Spieksma; Gerhard J. Woeginger (J. Comb. Optim., 2013)

A comprehensive benchmark set and heuristics for the traveling thief problem. - Sergey Polyakovskiy; Mohammad Reza Bonyadi; Markus Wagner 007; Zbigniew Michalewicz; Frank Neumann 001 (GECCO, 2014)

A multi-agent system for the weighted earliness tardiness parallel machine problem. - Sergey Polyakovskiy; Rym M'Hallah (Comput. Oper. Res., 2014)

Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems. - Sergey Polyakovskiy; Frank Neumann 001 (CPAIOR, 2015)

Approximate Approaches to the Traveling Thief Problem. - Hayden Faulkner; Sergey Polyakovskiy; Tom Schultz; Markus Wagner 007 (GECCO, 2015)

On the Impact of the Renting Rate for the Unconstrained Nonlinear Knapsack Problem. - Junhua Wu; Sergey Polyakovskiy; Frank Neumann 001 (GECCO, 2016)

The Focus of Attention Problem. - Dries R. Goossens; Sergey Polyakovskiy; Frits C. R. Spieksma; Gerhard J. Woeginger (Algorithmica, 2016)

Solving hard control problems in voting systems via integer programming. - Sergey Polyakovskiy; Rudolf Berghammer; Frank Neumann 001 (Eur. J. Oper. Res., 2016)

Just-in-time batch scheduling problem with two-dimensional bin packing constraints. - Sergey Polyakovskiy; Alexander Makarowsky; Rym M'Hallah (GECCO, 2017)

Exact Approaches for the Travelling Thief Problem. - Junhua Wu; Markus Wagner 007; Sergey Polyakovskiy; Frank Neumann 001 (SEAL, 2017)

The Packing While Traveling Problem. - Sergey Polyakovskiy; Frank Neumann 001 (Eur. J. Oper. Res., 2017)

A Fully Polynomial Time Approximation Scheme for Packing While Traveling. - Frank Neumann 001; Sergey Polyakovskiy; Martin Skutella; Leen Stougie; Junhua Wu (ALGOCLOUD, 2018)

Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem. - Junhua Wu; Sergey Polyakovskiy; Markus Wagner 007; Frank Neumann 001 (GECCO, 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)

Just-in-time batch scheduling subject to batch size. - Sergey Polyakovskiy; Dhananjay R. Thiruvady; Rym M'Hallah (GECCO, 2020)

A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem. - Sergey Polyakovskiy; Rym M'Hallah (Eur. J. Oper. Res., 2022)

A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem. - Sergey Polyakovskiy; Peter J. Stuckey (ICAPS, 2023)