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 条
  • [31] Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
    Gondzio, Jacek
    Yildirim, E. Alper
    JOURNAL OF GLOBAL OPTIMIZATION, 2021, 81 (02) : 293 - 321
  • [32] Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
    Jacek Gondzio
    E. Alper Yıldırım
    Journal of Global Optimization, 2021, 81 : 293 - 321
  • [33] Linear Reformulations of Integer Quadratic Programs
    Billionnet, Alain
    Elloumi, Sourour
    Lambert, Amelie
    MODELLING, COMPUTATION AND OPTIMIZATION IN INFORMATION SYSTEMS AND MANAGEMENT SCIENCES, PROCEEDINGS, 2008, 14 : 43 - +
  • [34] Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
    Zheng, Xiaojin
    Sun, Xiaoling
    Li, Duan
    Cui, Xueting
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 221 (01) : 38 - 48
  • [35] Integer linear programming formulations of the filter partitioning minimization problem
    Hazhar Rahmani
    Jason M. O’Kane
    Journal of Combinatorial Optimization, 2020, 40 : 431 - 453
  • [36] Mixed integer programming formulations for the Biomass Truck Scheduling problem
    Torjai, Laszlo
    Kruzslicz, Ferenc
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2016, 24 (03) : 731 - 745
  • [37] On Mixed-Integer Programming Formulations for the Unit Commitment Problem
    Knueven, Bernard
    Ostrowski, James
    Watson, Jean-Paul
    INFORMS JOURNAL ON COMPUTING, 2020, 32 (04) : 857 - 876
  • [38] Continuous covering on networks: Improved mixed integer programming formulations
    Pelegrin, Mercedes
    Xu, Liding
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2023, 117
  • [39] COMPACT NORMAL FORMS IN PROPOSITIONAL LOGIC AND INTEGER PROGRAMMING FORMULATIONS
    WILSON, JM
    COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (03) : 309 - 314
  • [40] Compact mixed-integer programming formulations in quadratic optimization
    Beach, Benjamin
    Hildebrand, Robert
    Huchette, Joey
    JOURNAL OF GLOBAL OPTIMIZATION, 2022, 84 (04) : 869 - 912