Foundation-penalty cuts for mixed-integer programs

被引：7
作者：
Glover, F [1 ]
Sherali, HD
机构：
[1] Univ Colorado, Leeds Sch Business, Boulder, CO 80309 USA
[2] Virginia Polytech Inst & State Univ, Dept Ind & Syst Engn 0188, Blacksburg, VA 24061 USA
来源：
OPERATIONS RESEARCH LETTERS | 2003年 / 31卷 / 04期
基金：
美国国家科学基金会;
关键词：
mixed-integer programming; cutting planes; B& B penalties;
D O I：
10.1016/S0167-6377(03)00014-2
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We propose a new class of foundation-penalty (FP) cuts for MIPs that are easy to generate by exploiting routine penalty calculations. Their underlying concept generalizes the lifting process and provides derivations of major classical cuts. (Gomory cuts arise from low level FP cuts by simply 'plugging in' standard penalties.) (C) 2003 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：245 / 253
页数：9
相关论文
共 50 条
  • [21] Classical cuts for mixed-integer programming and branch-and-cut
    Manfred Padberg
    [J]. Mathematical Methods of Operations Research, 2001, 53 : 173 - 203
  • [22] A relax-and-cut framework for gomory mixed-integer cuts
    Fischetti M.
    Salvagnin D.
    [J]. Mathematical Programming Computation, 2011, 3 (2) : 79 - 102
  • [23] Coefficient strengthening: a tool for reformulating mixed-integer programs
    Andersen, Kent
    Pochet, Yves
    [J]. MATHEMATICAL PROGRAMMING, 2010, 122 (01) : 121 - 154
  • [24] On Robustness of Mixed-Integer reformulations of Generalized Disjunctive Programs
    Bogataj, Milos
    Kravanja, Zdravko
    [J]. 29TH EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, PT A, 2019, 46 : 1117 - 1122
  • [25] Extending the QCR method to general mixed-integer programs
    Billionnet, Alain
    Elloumi, Sourour
    Lambert, Amelie
    [J]. MATHEMATICAL PROGRAMMING, 2012, 131 (1-2) : 381 - 401
  • [26] Coefficient strengthening: a tool for reformulating mixed-integer programs
    Kent Andersen
    Yves Pochet
    [J]. Mathematical Programming, 2010, 122 : 121 - 154
  • [27] Extending the QCR method to general mixed-integer programs
    Alain Billionnet
    Sourour Elloumi
    Amélie Lambert
    [J]. Mathematical Programming, 2012, 131 : 381 - 401
  • [28] Alternative mixed-integer reformulation of Generalized Disjunctive Programs
    Bogataj, Milos
    Kravanja, Zdravko
    [J]. 28TH EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, 2018, 43 : 549 - 554
  • [29] An exact penalty global optimization approach for mixed-integer programming problems
    S. Lucidi
    F. Rinaldi
    [J]. Optimization Letters, 2013, 7 : 297 - 307
  • [30] An exact penalty global optimization approach for mixed-integer programming problems
    Lucidi, S.
    Rinaldi, F.
    [J]. OPTIMIZATION LETTERS, 2013, 7 (02) : 297 - 307
12345