The theory of convex extensions in combinatorial optimization problems

DOI10.15407/dopovidi2017.08.020zbMath1389.90273OpenAlexW2750419440MaRDI QIDQ4593114

S. V. Yakovliev

Publication date: 21 November 2017

Published in: Reports of the National Academy of Sciences of Ukraine (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15407/dopovidi2017.08.020

zbMATH Keywords

combinatorial optimizationconvex extensionvertex located setcombinatorial polyhedron

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)

Related Items (2)

Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ Properties of combinatorial optimization problems over polyhedral-spherical sets

This page was built for publication: The theory of convex extensions in combinatorial optimization problems