Previous Page

|

Next Page

References

Achterberg, T., Koch, T., and Martin, A. (2005), "Branching Rules Revisited," Operations Research Letters , 33(1), 42--54. 

Andersen, E. D. and Andersen, K. D. (1995), "Presolving in Linear Programming," Mathematical Programming , 71(2), 221--245. 

Atamturk, A. (2004), "Sequence Independent Lifting for Mixed-Integer Programming," Operations Research , 52, 487--490. 

Dantzig, G. B., Fulkerson, R., and Johnson, S. M. (1954), "Solution of a Large-Scale Traveling Salesman Problem," Operations Research , 2, 393--410. 

Gondzio, J. (1997), "Presolve Analysis of Linear Programs prior to Applying an Interior Point Method," INFORMS Journal on Computing , 9 (1), 73--91. 

Land, A. H. and Doig, A. G. (1960), "An Automatic Method for Solving Discrete Programming Problems," Econometrica , 28, 497--520. 

Linderoth, J. T. and Savelsbergh, M. (1998), "A Computational Study of Search Strategies for Mixed Integer Programming," INFORMS Journal on Computing , 11, 173--187. 

Marchand, H., Martin, A., Weismantel, R., and Wolsey, L. (1999), "Cutting Planes in Integer and Mixed Integer Programming," DP 9953, CORE, Universite Catholique de Louvainla-Neuve, 1999. 

Miller, C. E., Tucker, A. W., and Zemlin, R. A. (1960), "Integer Programming Formulations of Traveling Salesman Problems," Journal of the Association for Computing Machinery , 7(4), 326--329. 

Savelsbergh, M. W. P. (1994), "Preprocessing and Probing Techniques for Mixed Integer Programming Problems," ORSA J. on Computing , 6, 445--454.