Optimal cycles enclosing all the nodes of a $k$-dimensional hypercube

Roberto Rinaldi, Marco Ripà

We solve the general problem of visiting all the $2^k$ nodes of a $k$-dimensional hypercube by using a polygonal chain that has minimum link-length, and we show that this optimal v…