Sergey Polyakovskiy

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 20

Top Topics

Integer Program

Knapsack Problem

Packing Problem

Top Venues

Eur. J. Oper. Res.

Publications

Sergey Polyakovskiy, Peter J. Stuckey
A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem. ICAPS (2023)
Sergey Polyakovskiy, Rym M'Hallah
A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem. Eur. J. Oper. Res. 299 (1) (2022)
Sergey Polyakovskiy, Dhananjay R. Thiruvady, Rym M'Hallah
Just-in-time batch scheduling subject to batch size. GECCO (2020)
Frank Neumann, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, Junhua Wu
A Fully Polynomial Time Approximation Scheme for Packing While Traveling. ALGOCLOUD (2018)
Sergey Polyakovskiy, Rym M'Hallah
A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates. Eur. J. Oper. Res. 266 (3) (2018)
Junhua Wu, Sergey Polyakovskiy, Markus Wagner, Frank Neumann
Evolutionary Computation plus Dynamic Programming for the Bi-Objective Travelling Thief Problem. CoRR (2018)
Junhua Wu, Sergey Polyakovskiy, Markus Wagner, Frank Neumann
Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem. GECCO (2018)
Sergey Polyakovskiy, Alexander Makarowsky, Rym M'Hallah
Just-in-Time Batch Scheduling Problem with Two-dimensional Bin Packing Constraints. CoRR (2017)
Sergey Polyakovskiy, Rym M'Hallah
A Hybrid Feasibility Constraints-Guided Search to the Two-Dimensional Bin Packing Problem with Due Dates. CoRR (2017)
Junhua Wu, Markus Wagner, Sergey Polyakovskiy, Frank Neumann
Exact Approaches for the Travelling Thief Problem. SEAL (2017)
Frank Neumann, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, Junhua Wu
A Fully Polynomial Time Approximation Scheme for Packing While Traveling. CoRR (2017)
Junhua Wu, Markus Wagner, Sergey Polyakovskiy, Frank Neumann
Exact Approaches for the Travelling Thief Problem. CoRR (2017)
Sergey Polyakovskiy, Frank Neumann
The Packing While Traveling Problem. Eur. J. Oper. Res. 258 (2) (2017)
Sergey Polyakovskiy, Alexander Makarowsky, Rym M'Hallah
Just-in-time batch scheduling problem with two-dimensional bin packing constraints. GECCO (2017)
Sergey Polyakovskiy, Rudolf Berghammer, Frank Neumann
Solving hard control problems in voting systems via integer programming. Eur. J. Oper. Res. 250 (1) (2016)
Junhua Wu, Sergey Polyakovskiy, Frank Neumann
On the Impact of the Renting Rate for the Unconstrained Nonlinear Knapsack Problem. GECCO (2016)
Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
The Focus of Attention Problem. Algorithmica 74 (2) (2016)
Sergey Polyakovskiy, Frank Neumann
The Packing While Traveling Problem. CoRR (2015)
Sergey Polyakovskiy, Frank Neumann
Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems. CPAIOR (2015)
Hayden Faulkner, Sergey Polyakovskiy, Tom Schultz, Markus Wagner
Approximate Approaches to the Traveling Thief Problem. GECCO (2015)
Sergey Polyakovskiy, Rudolf Berghammer, Frank Neumann
Solving Hard Control Problems in Voting Systems via Integer Programming. CoRR (2014)
Sergey Polyakovskiy, Frank Neumann
Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems. CoRR (2014)
Sergey Polyakovskiy, Rym M'Hallah
A multi-agent system for the weighted earliness tardiness parallel machine problem. Comput. Oper. Res. 44 (2014)
Sergey Polyakovskiy, Mohammad Reza Bonyadi, Markus Wagner, Zbigniew Michalewicz, Frank Neumann
A comprehensive benchmark set and heuristics for the traveling thief problem. GECCO (2014)
Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
The three-dimensional matching problem in Kalmanson matrices. J. Comb. Optim. 26 (1) (2013)
Sergey Polyakovskiy, Rym M'Hallah
Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System. OR (2012)
Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
Between a rock and a hard place: the two-to-one assignment problem. Math. Methods Oper. Res. 76 (2) (2012)
Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
The Focus of Attention Problem. SODA (2010)
Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
The approximability of three-dimensional assignment problems with bottleneck objective. Optim. Lett. 4 (1) (2010)
Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
Between a Rock and a Hard Place: The Two-to-One Assignment Problem. WAOA (2009)