|
This article is cited in 4 scientific papers (total in 4 papers)
On the faces of the graph approximation problem polytope
R. Yu. Simanchevab, I. V. Urazovaa a Omsk State University, 55-a Mira Ave., 644077 Omsk, Russia
b Omsk Scientific Center, SB RAS, 15/1 K. Marx Ave., 644024 Omsk, Russia
Abstract:
We study the polytope of the graph approximation problem. The polyhedral relaxation of this polytope is built. We describe the class of valid inequalities for this polytope among which the inequalities that generate facets are allocated. Ill. 1, bibliogr. 9.
Keywords:
stability of the solution, stability radius, Boolean polynomial, matroid, geometric configuration.
Received: 11.12.2014 Revised: 31.01.2015
Citation:
R. Yu. Simanchev, I. V. Urazova, “On the faces of the graph approximation problem polytope”, Diskretn. Anal. Issled. Oper., 22:2 (2015), 86–101; J. Appl. Industr. Math., 9:2 (2015), 283–291
Linking options:
https://www.mathnet.ru/eng/da815 https://www.mathnet.ru/eng/da/v22/i2/p86
|
|