Computing with multi-row gomory cuts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5035 LNCS, Issue , 2008, Pages 214-224

  Espinoza, Daniel G ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

AEROSPACE APPLICATIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; MULTITASKING; NONLINEAR PROGRAMMING; OPTIMIZATION; PLASMA WAVES; SEPARATION; SET THEORY;

(SPM) CLASSES; COMMERCIAL SOFTWARES; CUTTING PLANES; GENERAL (CO); GENERAL PURPOSE SOFTWARE; GOMORY CUTS; HEIDELBERG (CO); INFINITE RELAXATION; INTEGRAL PART; INTERNATIONAL CONFERENCES; MIXED INTEGERS; MIXED-INTEGER CUTS; SPRINGER (CO); VALID INEQUALITIES;

INTEGER PROGRAMMING;

EID: 45749156839     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68891-4_15     Document Type: Conference Paper

References (15)

1. Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Op. Res. Letters 33, 42-54 (2005)
2. Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Operations Research Letters 34(4), 361-372 (2006)
3. Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Inequalities from two rows of a simplex tableau. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 1-15. Springer, Heidelberg (2007)
4. Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: A test set of mixed integer programming problems. SIAM News 25(16) (1992)
5. Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice - closing the gap. In: Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization, Deventer, The Netherlands, pp. 19-50. Kluwer, B.V., Dordrecht (2000)
6. Cook, W., Kannan, R., Schrijver, A.: Chvátal closures for mixed integer programming problems. Math. Prog. 47, 155-174 (1990)
7. Cornuéjols, G., Borozan, V.: Minimal valid inequalities for integer constraints. In: George Nemhauser Symposium, Atlanta (July 2007)
8. Cornuéjols, G., Margot, F.: On the facets of mixed integer programs with two integer variables and two constraints. Tepper Working Paper 2007 E-35 (2007)
9. Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, RAND Corporation (1960)
10. Gomory, R.E.: Corner polyhedra and two-equation cutting planes. In: George Nemhauser Symposium, Atlanta (July 2007)
11. Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhe-dra, part I. Math. Prog. 3, 23-85 (1972)
12. ILOG CPLEX Division, Incline Village, Nevada, 89451, USA. CPLEX 10.2 Reference Manual (2007)
13. Knuth, D.E.: The Art of Computer Programming. Ch. 7.2.1.1, 1st edn., vol. 4. Addison-Wesley, Reading (2005)
14. Linderoth, J.T., Savelsbergh, M.W.P.: A computational study of search strategies for mixed integer programming. INFORMS J. on Computing 11, 173-187 (1999)
15. Lovász, L.: Geometry of numbers and integer programming. In: Iri, M., Tanabe, K. (eds.) Mathematical Programming: Recent Developments and Applications, pp. 177-210. Springer, Heidelberg (1989)