Sergey Polyakovskiy

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