This paper considers the optimal communication spanning tree (OCST) problem. Previouswork analyzed features of high-quality solutions and found that edges in optimal solutions havelow weight and point towards the center of a tree. Consequently, integrating this problem-specific knowledge into a...

We study the Euclidean variant of the optimalcommunication spanning tree (OCST) problem. An experimentalanalysis reveals that edges in optimal trees do not only have lowdistance weights but also point with higher probability towardsthe graph’s center. Consequently, we use this characteristic...

Rubik’s Cube is a popular three-dimensional mechanical puzzle developed inthe 1970’s. The aim of the puzzle is to restore a scrambled cube such that eachof the six faces of the cube is a solid color. This paper proposes an evolutionaryoptimization solver that finds a sequence of turns which...

The optimal communication spanning tree (OCST) problemis a well known NP-hard combinatorial optimizationproblem which seeks a spanning tree that satisfies all givencommunication requirements for minimal total costs. Ithas been shown that optimal solutions of OCST problemsare biased towards the...