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


On lifted cover inequalities: A new lifting procedure with unusual properties
Authors:Adam N Letchford  Georgia Souli
Abstract:Lifted cover inequalities are well-known cutting planes for 0–1 linear programs. We show how one of the earliest lifting procedures, due to Balas, can be significantly improved. The resulting procedure has some unusual properties. For example, (i) it can yield facet-defining inequalities even if the given cover is not minimal, (ii) it can yield facet-defining inequalities that cannot be obtained by standard lifting procedures, and (iii) the associated superadditive lifting function is integer-valued almost everywhere.
Keywords:Corresponding author    Knapsack problems  Lifted cover inequalities  Polyhedral combinatorics
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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