Mixed‐Integer Linear Programming

[1]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[2]  Egon Balas,et al.  Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..

[3]  M. Radke,et al.  Sensitivity Analysis in Discrete Optimization , 1975 .

[4]  R. Meyer.  Integer and mixed-integer programming models: General properties , 1975 .

[5]  E. Balas,et al.  Strengthening cuts for mixed integer programs , 1980 .

[6]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[7]  Martin W. P. Savelsbergh,et al.  An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .

[8]  Kent Andersen,et al.  Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts , 2005, Manag. Sci..

[9]  Robert E. Bixby,et al.  Progress in computational mixed integer programming—A look back from the other side of the tipping point , 2007, Ann. Oper. Res..

[10]  Egon Balas,et al.  Optimizing over the split closure , 2008, Math. Program..

[11]  Matteo Fischetti,et al.  Projected Chvátal–Gomory cuts for mixed integer linear programs , 2008, Math. Program..

[12]  François Margot,et al.  Testing cut generators for mixed-integer linear programming , 2009, Math. Program. Comput..

[13]  Egon Balas,et al.  Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants , 2009, Math. Program. Comput..

[14]  Andrea Lodi,et al.  MIR closures of polyhedral sets , 2009, Math. Program..

[15]  Gérard Cornuéjols,et al.  Improved strategies for branching on general disjunctions , 2011, Math. Program..