On one problem of integer optimization

A recognition problem of the following form is studied: to find put for the prescribed polyhedron whether the maximum of the linear objective function is achieved at its integral point. It is established that this problem is NP-hard in the general case and polynomially solvable in the class of rooted semimetric polyhedra.