首页 | 本学科首页   官方微博 | 高级检索  
     


Combinatorial optimization problems related to the committee polyhedral separability of finite sets
Authors:Vl. D. Mazurov  M. Yu. Khachay  M. I. Poberii
Affiliation:1.Institute of Mathematics and Mechanics,Ural Division of the Russian Academy of Sciences,Yekaterinburg,Russia
Abstract:In the paper, the computational and approximational complexity of the minimal affine separating committee problem, as well as of some important special cases of this problem, is investigated.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号