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


Complexity of linear relaxations in integer programming
Authors:Averkov  Gennadiy  Schymura  Matthias
Affiliation:1.BTU Cottbus-Senftenberg, Platz der Deutschen Einheit 1, 03046, Cottbus, Germany
;
Abstract:Mathematical Programming - For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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