Sciact
  • EN
  • RU

Polyhedral Attack on the Graph Approximation Problem Full article

Journal Communications in Computer and Information Science
ISSN: 1865-0929
Output data Year: 2019, Volume: 1090, Pages: 255-265 Pages count : 11 DOI: 10.1007/978-3-030-33394-2_20
Tags Branch and cut; Facet inequality; Local search; Rounding
Authors Simanchev R.Yu. 1,2 , Urazova I.V. 2 , Kochetov Yu.A. 3
Affiliations
1 Омский научный центр СО РАН
2 Dostoevsky Omsk State University
3 Sobolev Institute of Mathematics
Cite: Simanchev R.Y. , Urazova I.V. , Kochetov Y.A.
Polyhedral Attack on the Graph Approximation Problem
Communications in Computer and Information Science. 2019. V.1090. P.255-265. DOI: 10.1007/978-3-030-33394-2_20 Scopus OpenAlex
Identifiers:
Scopus: 2-s2.0-85076146271
OpenAlex: W2982592590
Citing: Пока нет цитирований
Altmetrics: