For the computational complexity of the proposed problem, we know that the NP-hard Max Cut problem is a special case of the unconstrained submodular set function maximization [1]}, therefore the more general form lattice submodular function maximization is also NP-hard.
