default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey Polyakovskiy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c15]Sergey Polyakovskiy, Peter J. Stuckey:
A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem. ICAPS 2023: 352-360- 2022
- [j10]Sergey Polyakovskiy
, Rym M'Hallah:
A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem. Eur. J. Oper. Res. 299(1): 104-117 (2022) - 2020
- [c14]Sergey Polyakovskiy, Dhananjay R. Thiruvady, Rym M'Hallah:
Just-in-time batch scheduling subject to batch size. GECCO 2020: 228-235
2010 – 2019
- 2018
- [j9]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): 819-839 (2018) - [c13]Frank Neumann, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, Junhua Wu:
A Fully Polynomial Time Approximation Scheme for Packing While Traveling. ALGOCLOUD 2018: 59-72 - [c12]Junhua Wu, Sergey Polyakovskiy, Markus Wagner, Frank Neumann:
Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem. GECCO 2018: 777-784 - [i8]Junhua Wu, Sergey Polyakovskiy, Markus Wagner, Frank Neumann:
Evolutionary Computation plus Dynamic Programming for the Bi-Objective Travelling Thief Problem. CoRR abs/1802.02434 (2018) - 2017
- [j8]Sergey Polyakovskiy, Frank Neumann:
The Packing While Traveling Problem. Eur. J. Oper. Res. 258(2): 424-439 (2017) - [c11]Sergey Polyakovskiy, Alexander Makarowsky, Rym M'Hallah:
Just-in-time batch scheduling problem with two-dimensional bin packing constraints. GECCO 2017: 321-328 - [c10]Junhua Wu, Markus Wagner, Sergey Polyakovskiy, Frank Neumann:
Exact Approaches for the Travelling Thief Problem. SEAL 2017: 110-121 - [i7]Frank Neumann, Sergey Polyakovskiy, Martin Skutella, Leen Stougie, Junhua Wu:
A Fully Polynomial Time Approximation Scheme for Packing While Traveling. CoRR abs/1702.05217 (2017) - [i6]Sergey Polyakovskiy, Rym M'Hallah:
A Hybrid Feasibility Constraints-Guided Search to the Two-Dimensional Bin Packing Problem with Due Dates. CoRR abs/1703.07244 (2017) - [i5]Sergey Polyakovskiy, Alexander Makarowsky, Rym M'Hallah:
Just-in-Time Batch Scheduling Problem with Two-dimensional Bin Packing Constraints. CoRR abs/1703.07290 (2017) - [i4]Junhua Wu, Markus Wagner, Sergey Polyakovskiy, Frank Neumann:
Exact Approaches for the Travelling Thief Problem. CoRR abs/1708.00331 (2017) - 2016
- [j7]Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger:
The Focus of Attention Problem. Algorithmica 74(2): 559-573 (2016) - [j6]Sergey Polyakovskiy, Rudolf Berghammer, Frank Neumann:
Solving hard control problems in voting systems via integer programming. Eur. J. Oper. Res. 250(1): 204-213 (2016) - [c9]Junhua Wu, Sergey Polyakovskiy, Frank Neumann:
On the Impact of the Renting Rate for the Unconstrained Nonlinear Knapsack Problem. GECCO 2016: 413-419 - 2015
- [c8]Sergey Polyakovskiy, Frank Neumann:
Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems. CPAIOR 2015: 332-346 - [c7]Hayden Faulkner, Sergey Polyakovskiy, Tom Schultz, Markus Wagner:
Approximate Approaches to the Traveling Thief Problem. GECCO 2015: 385-392 - [i3]Sergey Polyakovskiy, Frank Neumann:
The Packing While Traveling Problem. CoRR abs/1512.08831 (2015) - 2014
- [j5]Sergey Polyakovskiy, Rym M'Hallah:
A multi-agent system for the weighted earliness tardiness parallel machine problem. Comput. Oper. Res. 44: 115-136 (2014) - [c6]Sergey Polyakovskiy, Mohammad Reza Bonyadi, Markus Wagner, Zbigniew Michalewicz, Frank Neumann:
A comprehensive benchmark set and heuristics for the traveling thief problem. GECCO 2014: 477-484 - [i2]Sergey Polyakovskiy, Rudolf Berghammer, Frank Neumann:
Solving Hard Control Problems in Voting Systems via Integer Programming. CoRR abs/1408.5987 (2014) - [i1]Sergey Polyakovskiy, Frank Neumann:
Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems. CoRR abs/1411.5768 (2014) - 2013
- [j4]Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger:
The three-dimensional matching problem in Kalmanson matrices. J. Comb. Optim. 26(1): 1-9 (2013) - 2012
- [j3]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): 223-237 (2012) - [c5]Sergey Polyakovskiy, Rym M'Hallah:
Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System. OR 2012: 417-422 - 2011
- [c4]Sergey Polyakovsky, Rym M'Hallah:
An Intelligent Framework to Online Bin Packing in a Just-In-Time Environment. IEA/AIE (2) 2011: 226-236 - 2010
- [j2]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): 7-16 (2010) - [c3]Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger:
The Focus of Attention Problem. SODA 2010: 312-317
2000 – 2009
- 2009
- [j1]Sergey Polyakovsky, Rym M'Hallah:
An agent-based approach to the two-dimensional guillotine bin packing problem. Eur. J. Oper. Res. 192(3): 767-781 (2009) - [c2]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: 159-169 - 2007
- [c1]Sergey Polyakovsky, Rym M'Hallah:
An Agent-Based Approach to Knapsack Optimization Problems. IEA/AIE 2007: 1098-1107
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
