Sledovat
Sergey Polyakovskiy
Sergey Polyakovskiy
School of Computer Science, The University of Adelaide
E-mailová adresa ověřena na: adelaide.edu.au
Název
Citace
Citace
Rok
Sustainable supply chain network design: A case of the wine industry in Australia
M Varsei, S Polyakovskiy
Omega 66, 236-247, 2017
2772017
A comprehensive benchmark set and heuristics for the traveling thief problem
S Polyakovskiy, MR Bonyadi, M Wagner, Z Michalewicz, F Neumann
Proceedings of the 2014 annual conference on genetic and evolutionary …, 2014
1272014
Approximate approaches to the traveling thief problem
H Faulkner, S Polyakovskiy, T Schultz, M Wagner
Proceedings of the 2015 annual conference on genetic and evolutionary …, 2015
692015
An agent-based approach to the two-dimensional guillotine bin packing problem
S Polyakovsky, R M’Hallah
European Journal of Operational Research 192 (3), 767-781, 2009
682009
Exact approaches for the travelling thief problem
J Wu, M Wagner, S Polyakovskiy, F Neumann
Simulated Evolution and Learning: 11th International Conference, SEAL 2017 …, 2017
432017
A multi-agent system for the weighted earliness tardiness parallel machine problem
S Polyakovskiy, R M'Hallah
Computers & operations research 44, 115-136, 2014
372014
A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
S Polyakovskiy, R M’Hallah
European journal of operational research 266 (3), 819-839, 2018
362018
Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem
J Wu, S Polyakovskiy, M Wagner, F Neumann
Proceedings of the Genetic and Evolutionary Computation Conference, 777-784, 2018
342018
Just-in-time two-dimensional bin packing
S Polyakovskiy, R M’Hallah
Omega 102, 102311, 2021
292021
A fully polynomial time approximation scheme for packing while traveling
F Neumann, S Polyakovskiy, M Skutella, L Stougie, J Wu
Algorithmic Aspects of Cloud Computing: 4th International Symposium …, 2019
252019
On the impact of the renting rate for the unconstrained nonlinear knapsack problem
J Wu, S Polyakovskiy, F Neumann
Proceedings of the Genetic and Evolutionary Computation Conference 2016, 413-419, 2016
222016
Packing while traveling: Mixed integer programming for a class of nonlinear knapsack problems
S Polyakovskiy, F Neumann
International Conference on Integration of Constraint Programming …, 2015
192015
The packing while traveling problem
S Polyakovskiy, F Neumann
European Journal of Operational Research 258 (2), 424-439, 2017
182017
The approximability of three-dimensional assignment problems with bottleneck objective
D Goossens, S Polyakovskiy, FCR Spieksma, GJ Woeginger
Optimization Letters 4, 7-16, 2010
132010
Solving hard control problems in voting systems via integer programming
S Polyakovskiy, R Berghammer, F Neumann
European Journal of Operational Research 250 (1), 204-213, 2016
122016
The three-dimensional matching problem in Kalmanson matrices
S Polyakovskiy, FCR Spieksma, GJ Woeginger
Journal of Combinatorial Optimization 26, 1-9, 2013
122013
Just-in-time batch scheduling problem with two-dimensional bin packing constraints
S Polyakovskiy, A Makarowsky, R M'Hallah
Proceedings of the Genetic and Evolutionary Computation Conference, 321-328, 2017
112017
Just-in-time batch scheduling subject to batch size
S Polyakovskiy, D Thiruvady, R M'Hallah
Proceedings of the 2020 genetic and evolutionary computation conference, 228-235, 2020
102020
Between a rock and a hard place: the two-to-one assignment problem
D Goossens, S Polyakovskiy, FCR Spieksma, GJ Woeginger
Mathematical methods of operations research 76 (2), 223-237, 2012
102012
Between a rock and a hard place: the two-to-one assignment problem
D Goossens, S Polyakovskiy, FCR Spieksma, GJ Woeginger
Mathematical methods of operations research 76 (2), 223-237, 2012
102012
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20