◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

R. Staněk

5 papers hereh-index 11458 citations51 works total

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

author position
  • first author2
  • last author3

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

fields
  • math.OC4
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20132021
most citedGenerating subtour elimination constraints for the TSP from pure integer solutions

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

collaborators
Showing 2015Show all

2 papers · 1 filter

math.OC2015

The data arrangement problem on binary trees

Eranda Cela, Joachim Schauer, Rostislav Stanek

The data arrangement problem on regular trees (DAPT) consists in assigning the vertices of a given graph G, called the guest graph, to the leaves of a d-regular tree T, called the…

math.OC2015★ 68 cited

Generating subtour elimination constraints for the TSP from pure integer solutions

Ulrich Pferschy, Rostislav Stanek

The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph G = (V, E) and non-negative distances d for every edge…

◍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.