|
Diskretnyi Analiz i Issledovanie Operatsii, 2014, Volume 21, Issue 3, Pages 82–86
(Mi da778)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Polytopes and connected subgraphs
A. V. Seliverstov Institute for Information Transmission Problems (Kharkevich Institute), RAS, 19 Bolshoy Karetny Lane, 127994 Moscow, Russia
Abstract:
The edges of the linear relaxation polytopes for quadratic Boolean programming problems are described. We found correspondence between the edges of such a polytope and connected subgraphs of the complete graph. Tab. 1, bibliogr. 14.
Keywords:
combinatorial optimization, polyhedral cone, polytope, subgraph.
Received: 22.08.2013 Revised: 17.02.2014
Citation:
A. V. Seliverstov, “Polytopes and connected subgraphs”, Diskretn. Anal. Issled. Oper., 21:3 (2014), 82–86
Linking options:
https://www.mathnet.ru/eng/da778 https://www.mathnet.ru/eng/da/v21/i3/p82
|
Statistics & downloads: |
Abstract page: | 314 | Full-text PDF : | 66 | References: | 47 | First page: | 10 |
|