Integer Programming

• Applegate, D., Bixby, R., Chvatal, V. and Cook, W., 1998, On the solution of traveling salesman problems, in: Proc. Int. Congress of Mathematicians, Doc. Math. J. DMV, Vol. 645.

  Google Scholar 

• Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P. and Vance, P. H., 1998, Branch-and-price: column generation for huge integer programs, Oper. Res. 46:316.

  Article  MATH  MathSciNet  Google Scholar 

• Bixby, R. E., Fenelon, M., Gu, Z., Rothberg, E. and Wunderling, R., 1999, MIP: Theory and Practice—Closing the Gap, Proc. 19th IFIP TC7 Conf. on System Modelling, Kluwer, Dordrecht, pp. 19–50.

  Google Scholar 

• Common Optimization INterface for Operations Research (COIN), 2004, at http://www.coin-or.org

  Google Scholar 

• Cordier, C., Marchand, H., Laundy, R. and Wolsey, L. A., 1999, bc-opt: a branch-and-cut code for mixed integer programs, Math. Program. 86:335.

  Article  MATH  MathSciNet  Google Scholar 

• Crowder, H., Johnson, E. L. and Padberg, M. W., 1983, Solving large scale zero-one linear programming problems, Oper. Res. 31:803–834.

  MATH  Google Scholar 

• Gomory, R. E., 1958, Outline of an algorithm for integer solutions to linear programs, Bulletin AMS 64:275–278.

  MATH  MathSciNet  Google Scholar 

• Gueret, C, Prins, C. and Sevaux, M., 2002, Applications of Optimization with Xpress-MP, S. Heipcke, transl., Dash Optimization, Blisworth, UK.

  Google Scholar 

• Hillier, F. S. and Lieberman, G. J., 2002, Introduction to Operations Research, McGraw-Hill, New York.

  Google Scholar 

• ILOG CPLEX 9.0 Reference Manual, 2004, ILOG.

  Google Scholar 

• Juenger, M., Reinelt, G. and Thienel, S., 1995, Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 111, American Mathematical Society, Providence, RI.

  Google Scholar 

• Land, A. H. and Doig, A. G., 1960, An Automatic Method for Solving Discrete Programming Problems, Econometrica 28:83–97.

  Article  MathSciNet  Google Scholar 

• Nemhauser, G. L. and Wolsey, L. A., 1998, Integer and Combinatorial Optimization, Wiley, New York.

  Google Scholar 

• Ralphs, T. K. and Ladanyi, L., 1999, SYMPHONY: A Parallel Framework for Branch and Cut, White paper, Rice University.

  Google Scholar 

• Schrijver, A., 1998, Theory of Linear and Integer Programming, Wiley, New York.

  MATH  Google Scholar 

• Taha, H. A., 2002, Operations Research: An Introduction, Prentice-Hall, New York.

  Google Scholar 

• Williams, H. P., 1999, Model Building in Mathematical Programming, Wiley, New York.

  Google Scholar 

• Winston, W., 1997, Operations Research: Applications and Algorithms, Thomson, New York.

  Google Scholar 

• Wolsey, L. A., 1998, Integer Programming, Wiley, New York.

  MATH  Google Scholar 

• XPRESS-MP Extended Modeling and Optimisation Subroutine Library, Reference Manual, 2004, Dash Optimization, Blisworth, UK.

  Google Scholar 

Download references