On the polytope faces of the graph approximation problem
Ruslan Yu. Simanchev, И. В. Уразова · Journal of Applied and Industrial Mathematics · 2015
We study the polytope of the graph approximation problem. Some polyhedral relaxation of this polytope is built. We describe the class of valid inequalities for this polytope among which the inequalities that generate the facets are allocated.