Formulations and reformulations in integer programming

被引:0
|
作者
Trick, M [1 ]
机构
[1] Carnegie Mellon Univ, Tepper Sch Business, Pittsburgh, PA 15213 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Creating good integer programming formulations had, as a basic axiom, the rule "Find formulations with tighter linear relaxations". This rule, while useful when using unsophisticated branch-and-bound codes,is insufficient when using state-of-the-art codes that understand and embed many of the obvious formulation improvements. As these optimization codes become more sophisticated it is important to have finer control over their operation. Modelers need to be even more creative in reformulating their integer programs in order to improve on the automatic reformulations of the optimization codes.
引用
收藏
页码:366 / 379
页数:14
相关论文
共 50 条
  • [21] Integer programming formulations for the shared multicast tree problem
    Ivanova, Marika
    Haugland, Dag
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 38 (03) : 927 - 956
  • [22] Extended formulations in mixed integer conic quadratic programming
    Vielma J.P.
    Dunning I.
    Huchette J.
    Lubin M.
    Mathematical Programming Computation, 2017, 9 (3) : 369 - 418
  • [23] Integer programming formulations for the elementary shortest path problem
    Taccari, Leonardo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (01) : 122 - 130
  • [24] An empirical analysis of integer programming formulations for the permutation flowshop
    Tseng, FT
    Stafford, EF
    Gupta, JND
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2004, 32 (04): : 285 - 293
  • [25] INTEGER PROGRAMMING FORMULATIONS OF VEHICLE-ROUTING PROBLEMS
    KULKARNI, RV
    BHAVE, PR
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 20 (01) : 58 - 67
  • [26] Integer programming formulations for minimum deficiency interval coloring
    Bodur, Merve
    Luedtke, James R.
    NETWORKS, 2018, 72 (02) : 249 - 271
  • [27] Mixed integer linear programming formulations for probabilistic constraints
    Vielma, J. P.
    Ahmed, S.
    Nemhauser, G. L.
    OPERATIONS RESEARCH LETTERS, 2012, 40 (03) : 153 - 158
  • [28] Reformulations and Branching Methods for Mixed-Integer Programming Chemical Production Scheduling Models
    Velez, Sara
    Maravelias, Christos T.
    INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2013, 52 (10) : 3832 - 3841
  • [29] Optimal connected subgraphs: Integer programming formulations and polyhedra
    Rehfeldt, Daniel
    Franz, Henriette
    Koch, Thorsten
    NETWORKS, 2022, 80 (03) : 314 - 332
  • [30] Mixed-integer quadratic programming reformulations of multi-task learning models
    Lapucci, Matteo
    Pucci, Davide
    MATHEMATICS IN ENGINEERING, 2023, 5 (01): : 1 - 16