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