Mixed integer programming: A historical perspective with Xpress-MP

Annals of Operations Research

Volumn 149, Issue 1, 2007, Pages 5-17

  Ashford, Robert ^a,b  

^a Quinton Lodge   (United Kingdom)

^b Quinton Lodge   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33846897458     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-006-0092-x     Document Type: Review

References (27)

1. Ashford, R.W., P. Connard, and R.C. Daniel. (1992). "Experiments in Solving Mixed Integer Programming Problems on a Small Array of Transputers." Journal of the Operational Research Society, 43(5), 519-531.
2. Ashford, R.W. and R.C. Daniel. (1989). "Element Pools and Numeric Co-Processors for Linear Programming on Personal Computers." Journal of the Operational Research Society, 40(6), 591-596.
3. Ashford, R.W. and R.C. Daniel. (1992). "Some Lessons in Solving Practical Integer Programs." Journal of the Operational Research Society, 43(5), 425-433.
4. Beale, E.M.L. (1968). Mathematical Programming in Practice. Pitman, London.
5. Brearley, A.L., G. Mitra, and H.P., Williams. (1975). "Analysis of Mathematical Programming Problems Prior to Applying the Simplex Method." Mathematical Programming, 8, 54-83.
6. Dash Optimization (2006). "Xpress-MP Optimizer Reference Manual", Dash Optimization Limited, Blisworth House, Church Lane, Blisworth, Nothants NN7 3BX, UK.
7. Fischetti, M. and A. Lodi. (2003). "Local Branching." Mathematical Programming, 98, 23-47.
8. Forrest, J.J.H, J.P.H., Hirst, and J.A. Tomlin. (1972). "Practical Solution of Large Mixed Integer Programming Problems with UMPIRE." Management Science, 20, 736-743.
9. Forrest, J.J.H. and J.A. Tomlin. (1972). "Updating the Triangular Factors of the Basis to Maintain Sparsity in the Product form Simplex Method." Mathematical Programming, 2, 263-278.
10. Gay, D. (1985). "Electronic Mail Distribution of Linear Programming Test Problems." Mathematical Programming Society COAL Newsletter, 13, 10-12.
11. Glover, F. and M. Laguna. (1997a). "General Purpose Heuristics For Integer Programming: Part I." Journal of Heuristics, 2, 343-358.
12. Glover, F. and M. Laguna. (1997b). "General Purpose Heuristics For Integer Programming: Part II." Journal of Heuristics, 3, 161-179.
13. Gomory, R.E. (1960). "An Algorithm for the Mixed Integer Problem." Technical Report RM-2597, The Rand Corporation.
14. Guignard, M. and K. Spielberg. (1981). "Logical Reduction Methods in Zero-one Programming: Minimal Preferred Inequalities." Operations Research, 29, 49-74.
15. IBM (1988). "Mathematical Programming System Extended/370 (MPSX/370) Version 2 User Guide." IBM document, SH19-6553-0.
16. Hall, J.A.J. and K.I.M. McKinnon. (2004). "Hyper-Sparsity in the Revised Simplex Method and how to Exploit it." Submitted to Computational Optimization and Applications.
17. Heipcke, S. (1999). "Comparing Constraint Programming and Mathematical Programming Approaches to Discrete Optimisation. The Change Problem." Journal of the Operational Research Society, 50(6), 581-595.
18. Land, A.H. and A.G. Doig. (1960). "An Automatic Method for Solving Discrete Programming Problems." Econometrica, 28, 497-520.
19. Laundy, R.S. (1999). "Implementation of Parallel Branch-and-Bound Algorithms in Xpress-MP." In: Operational Research in Industry, ed: Ciriani, Gliozzi, Johnson and Tadei, MacMillan, London.
20. Lustig, I.J., R.E. Marsten, and D.F., Shanno. (1991). "Computational Experience with a Primal-Dual Interior Point Method for Linear Programming." Linear Algebra and Its Applications, 152, 191-222.
21. Meszaros, C. (1997). "On free Variables in Interior Point Methods." Optimization Methods and Software, 9, 121-139.
22. Moore, G.E. (1965). "Cramming More Components onto Integrated Circuits." Electronics, 38 (8).
23. Reid, J.K. (1982). "A Sparsity-exploiting Variant of the Bartels-Golub Decomposition for Linear Programming Bases." Mathematical Programming, 24, 55-69.
24. van Roy, T. and L.A., Wolsey. (1986). "Solving Mixed 0-1 Programs by Automatic Reformulation." Operations Research, 35, 45-57.
25. Spielberg, K. and M. Guignard. (2000). "A Sequential (quasi) hot Start Method for BB (0,1) Mixed Integer Programming." Presented at the 17th International Symposium on Mathematical Programming, Atlanta, GA, August 2000.
26. Suhl, U.H. and L.M., Suhl. (1990). "Computing Sparse LU Factorizations for Large-Scale linear Programming Bases." ORSA Journal on Computing, 2(4), 325-335.
27. Wolsey, L.A. (1990). "Valid Inequalities for 0-1 Knapsacks and MIPS with Generalised Upper Bound Constraints." Discrete Applied Mathematics, 29, 251-261.