◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Polyakovskiy

2 papers hereh-index 14812 citations31 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author2

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.DS2

identity via Semantic Scholar / OpenAlex

most citedA Fully Polynomial Time Approximation Scheme for Packing While Traveling

5 citations · 5 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2017

Exact Approaches for the Travelling Thief Problem

Junhua Wu, Markus Wagner, Sergey Polyakovskiy +1

Many evolutionary and constructive heuristic approaches have been introduced in order to solve the Traveling Thief Problem (TTP). However, the accuracy of such approaches is unknow…

cs.DS2017★ 5 cited

A Fully Polynomial Time Approximation Scheme for Packing While Traveling

Frank Neumann, Sergey Polyakovskiy, Martin Skutella +2

Understanding the interactions between different combinatorial optimisation problems in real-world applications is a challenging task. Recently, the traveling thief problem (TTP),…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.