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


On Compact Formulations for Integer Programs Solved by Column Generation
Authors:Daniel?Villeneuve,Jacques?Desrosiers  author-information"  >  author-information__contact u-icon-before"  >  mailto:Jacques.Desrosiers@hec.ca"   title="  Jacques.Desrosiers@hec.ca"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author,Marco?E.?Lübbecke,Fran?ois?Soumis
Affiliation:1.Kronos Inc.,Montréal,Canada;2.HEC Montréal and GERAD 3000,Montréal,Canada;3.Technische Universit?t Berlin, Institut für Mathematik,Berlin,Germany;4.école Polytechnique de Montréal and GERAD,Montréal,Canada
Abstract:Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subproblem and branching rule disappear when branching decisions are based on imposing constraints on the subproblem's variables. This can be generalized to branching on variables of a so-called compact formulation. We constructively show that such a formulation always exists under mild assumptions. It has a block diagonal structure with identical subproblems, each of which contributes only one column in an integer solution. This construction has an interpretation as reversing a Dantzig-Wolfe decomposition. Our proposal opens the way for the development of branching rules adapted to the subproblem's structure and to the linking constraints.
Keywords:integer programming  column generation  branch-and-bound
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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