Planar Euclidean Maximum TSP

Given $n$ points in $\mathbb{R}^2$, find a Hamiltonian cycle of the complete geometric graph maximizing the sum of Euclidean edge lengths. Determine whether this optimization problem is solvable in polynomial time or is NP-hard.