S. Polyakovskiy

Available identifiers

Publication	Date of Publication	Type
A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem	2022-02-23	Paper
A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates	2018-05-30	Paper
The packing while traveling problem	2018-05-25	Paper
Solving hard control problems in voting systems via integer programming	2016-10-07	Paper
Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems	2016-07-25	Paper
The focus of attention problem	2016-03-29	Paper
A multi-agent system for the weighted earliness tardiness parallel machine problem	2015-02-25	Paper
Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System	2015-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q5417626	2014-05-22	Paper
The three-dimensional matching problem in kalmanson matrices	2013-08-09	Paper
Between a rock and a hard place: the two-to-one assignment problem	2013-02-20	Paper
Between a Rock and a Hard Place: The Two-to-One Assignment Problem	2010-05-11	Paper
The approximability of three-dimensional assignment problems with bottleneck objective	2010-01-29	Paper
An agent-based approach to the two-dimensional guillotine bin packing problem	2009-04-08	Paper

This page was built for person: S. Polyakovskiy