On the polytope faces of the graph approximation problem
From MaRDI portal
Publication:3186827
DOI10.1134/S1990478915020143zbMath1349.90722MaRDI QIDQ3186827
I. V. Urazova, R. Yu. Simanchev
Publication date: 12 August 2016
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)
Related Items (2)
On facet-inducing inequalities for combinatorial polytopes ⋮ The Branch and Cut Method for the Clique Partitioning Problem
Cites Work
This page was built for publication: On the polytope faces of the graph approximation problem