Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem