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.


Integer Programming Linear Relaxation Integer Programming Formulation Major League Baseball Cover Inequality 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aardal, K.: Reformulation of capacitated facility location problems: how redundant information can help. Annals of Operations Research 82, 289–308 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-Price: Column Generation for Huge Integer Programs. Operations Research 46, 316 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Crowder, H., Johnson, E.L., Padberg, M.W.: Solving Large Scale Zero-One Linear Programming Problems. Operations Research 31, 803–834 (1983)zbMATHCrossRefGoogle Scholar
  4. 4.
    Easton, K., Nemhauser, G.L., Trick, M.A.: Solving the Traveling Tournament Problem: A Combined Integer and Constraint Programming Approach. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 63–77. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Trick, M.A.: Integer and Constraint Programming Approaches for Round Robin Tournament Scheduling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 63–77. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  6. 6.
    Williams, H.P.: Model Building in Mathematical Programming. Wiley, New York (1999)Google Scholar
  7. 7.
    XPRESS-MP Extended Modeling and Optimisation Subroutine Library, Reference Manual (2004), Dash Associates, Blisworth House, Blisworth, NorthantsGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Michael Trick
    • 1
  1. 1.Tepper School of Business, Carnegie MellonPittsburghUSA

Personalised recommendations