RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2017, Volume 24, Number 4, Pages 95–110 (Mi da884)  

On facet-inducing inequalities for combinatorial polytopes

R. Yu. Simanchevab

a Omsk Scientific Center SB RAS, 15 Karl Marx Ave., 644024 Omsk, Russia
b Dostoevsky Omsk State University, 55A Mira Ave., 630077 Omsk, Russia

Abstract: One of the central questions of polyhedral combinatorics is the question of the algorithmic relationship between the vertex and facet descriptions of convex polytopes. From the standpoint of combinatorial optimization, the main reason for the actuality of this question is the possibility of applying the methods of convex analysis to solving the extremal combinatorial problems. In this paper, we consider the combinatorial polytopes of a sufficiently general form. We obtain a few of necessary conditions and a sufficient condition for a supporting inequality of a polytope to be a facet inequality and give an illustration of the use of the developed technology to the polytope of some graph approximation problem. Bibliogr. 20.

Keywords: polytope, facet, $M$-graph, supporting inequality.

DOI: https://doi.org/10.17377/daio.2017.24.563

Full text: PDF file (324 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2017, 11:4, 564–571

UDC: 519.8
Received: 18.01.2017
Revised: 12.05.2017

Citation: R. Yu. Simanchev, “On facet-inducing inequalities for combinatorial polytopes”, Diskretn. Anal. Issled. Oper., 24:4 (2017), 95–110; J. Appl. Industr. Math., 11:4 (2017), 564–571

Citation in format AMSBIB
\Bibitem{Sim17}
\by R.~Yu.~Simanchev
\paper On facet-inducing inequalities for combinatorial polytopes
\jour Diskretn. Anal. Issled. Oper.
\yr 2017
\vol 24
\issue 4
\pages 95--110
\mathnet{http://mi.mathnet.ru/da884}
\crossref{https://doi.org/10.17377/daio.2017.24.563}
\elib{http://elibrary.ru/item.asp?id=30551369}
\transl
\jour J. Appl. Industr. Math.
\yr 2017
\vol 11
\issue 4
\pages 564--571
\crossref{https://doi.org/10.1134/S1990478917040147}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85036455960}


Linking options:
  • http://mi.mathnet.ru/eng/da884
  • http://mi.mathnet.ru/eng/da/v24/i4/p95

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретный анализ и исследование операций
    Number of views:
    This page:101
    Full text:13
    References:16
    First page:8

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020