Valid inequalities based on the interpolation procedure

Mathematical Programming

Volumn 106, Issue 1, 2006, Pages 111-136

  Dash, Sanjeeb ^a   Günlük, Oktay ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; PROBABILISTIC LOGICS;

CUTTING PLANES; POLYHEDRA;

INTERPOLATION;

EID: 29144480298     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0600-9     Document Type: Article

References (20)

1. Acklam, P.J.: An algorithm for computing the inverse normal cumulative distribution function. http://home.online.no/~pjacklam/notes/invnorm/index.html
2. Applegate, D., Cook, W., Dash, S., Mevenkamp, M.: QSopt linear programming solver. http://www.isye.gatech.edu/~wcook/qsopt
3. Araoz, J., Gomory, R.E., Johnson, E.L., Evans, L.: Cyclic group and knapsack facets. Math. Prog. 96, 377-408 (2003)
4. Cornuejols, G., Li, Y., Vandenbussche, D.: K-Cuts: a variation of gomory mixed integer cuts from the LP tableau. INFORMS J. Comput. 15, 385-396 (2003)
5. Dash, S., Gunluk, O.: Valid inequalities based on simple mixed-integer sets. Math. Prog. To appear
6. Evans, L.: Cyclic groups and knapsack facets with applications to cutting planes. Ph.D. Thesis, Georgia Institute of Technology, Atlanta, Georgia, 2002
7. Fishman, G.: Monte Carlo. Springer. New York, 1995
8. Forrest, J.J.: CLP: Coin LP, a native simplex solver, http://www.ibm.com/developerworks /opensource/coin
9. Gomory, R.E.: Some polyhedra related to combinatorial problems. J. Linear Algebra and its Applications 2, 451-558 (1969)
10. Gomory, R.E.: personal communication, 2003
11. Gomory, R.E., Johnson, E.: Some continuous functions related to corner polyhedra I. Math. Prog. 3, 23-85 (1972)
12. Gomory, R.E., Johnson, E.: Some continuous functions related to corner polyhedra II. Math. Prog. 3, 359-389 (1972)
13. Gomory, R.E., Johnson, E.: T-space and cutting planes. Math. Prog. 96, 341-375 (2003)
14. Gomory, R.E., Johnson, E.L., Evans, L.: Corner polyhedra and their connection with cutting planes. Math. Prog. 96, 321-339 (2003)
15. Hunsaker, B.: Measuring facets of polyhedra to predict usefulness in branch-and-cut algorithms, Ph.D. Thesis, Georgia Institute of Technology, Atlanta, Georgia, 2003
16. Kuhn, H.W. : Discussion. In: L. Robinson, (ed.). Proceedings of the IBM Scientific Computing Symposium on Combinatorial Problems: March 16-18, 1964, IBM, White Plains, New York (1966), pp. 118-121
17. Kuhn, H. W: On the origin of the Hungarian method. In: J.K. Lenstra, A.H.G. Rinnooy Kan, A. Schrijver, (eds.), History of mathematical programming: a collection of personal reminiscences. Elsevier Science Publishers B.V., The Netherlands (1991), pp. 77-81
18. Marchand, H., Wolsey, L.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49, 363-371 (2001)
19. Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial optimization. Wiley, New York, 1988
20. Ross, S.: Introduction to probability and statistics. John Wiley and Sons, New York, 1987