68 citations · 83 across the 5 of their papers we have counts for
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…