68 citations · 83 across the 5 of their papers we have counts for
5 papers
Advanced optimization models for the location of charging stations in e-mobility
Anna Elisabeth Kastner, Peter Greistorfer, Rostislav Staněk
For a reduction in environmental pollution and dependency on petroleum, electric vehicles (EV) present an advantageous alternative to traditionally fossil-fuel powered automobiles.…
Geometric and LP-based heuristics for the quadratic travelling salesman problem
Rostislav Staněk, Peter Greistorfer, Klaus Ladner +1
A generalization of the classical TSP is the so-called quadratic travelling salesman problem (QTSP), in which a cost coefficient is associated with the transition in every vertex,…
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…
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…
Heuristics for the data arrangement problem on regular trees
Eranda Cela, Rostislav Stanek
The data arrangement problem on regular trees (DAPT) consists in assigning the vertices of a given graph G to the leaves of a d-regular tree T such that the sum of the pairwise dis…