Publications and reports

  1. On mixing inequalities: rank, closure and cutting plane proofs. 2009. SIAM Journal on Optimization (to appear); with Oktay Gunluk. (pdf)

  2. The master equality polyhedron with multiple rows. 2009. IBM Research Report RC24746; with Oktay Gunluk, Ricardo Fukasawa.

  3. Mixed integer rounding cuts and master group polyhedra. 2008. IBM Research Report RC24521.

  4. On nearly orthogonal lattice bases and Minkowski reduction. 2008. IBM Research Report RC24696; With Ramesh Neelamani, Gregory Sorkin.

  5. Numerically accurate Gomory mixed-integer cuts. 2008. Informs Journal On Computing (to appear); With William Cook, Ricardo Fukasawa, Marcos Goycoolea. (pdf)

  6. On a generalization of the master cyclic group polyhedron, Mathematical Programming (to appear); IPCO 2007. With Ricardo Fukasawa, Oktay Gunluk. (pdf)

  7. MIR closures of polyhedral sets. Mathematical Programming (to appear); IPCO 2007. With Oktay Gunluk, Andrea Lodi. (pdf)

  8. On the strength of Gomory cuts as group cuts. Mathematical Programming 115, 2008, 387-407. With Oktay Gunluk. (ps).

  9. Projected Chvatal-Gomory inequalities for mixed-integer programs. Mathematical Programming 113, 2008, 241-258.
    With Pierre Bonami, Gerard Cornuejols, Matteo Fischetti, Andrea Lodi. (ps)

  10. Production design for plate products in the steel industry. IBM Journal of Research and Development 51 , No. 3/4, 2007, 345-362. With Jayant Kalagnanam, Chandra Reddy, Sanghwa Song. (html, pdf)

  11. Exact solutions to linear programming problems. Operations Research Letters 35(6), 2007, 693-699.
    With David Applegate, William Cook, Daniel Espinoza. (pdf)

  12. On nearly orthogonal lattice bases, SIAM Journal on Discrete Mathematics 21 , issue 1, 2007, 199-219.
    With Ramesh Neelamani, Richard Baraniuk. (pdf)

  13. On the complexity of cutting plane proofs using split cuts. Operations Research Letters (to appear); IBM Research Report RC24082, 2006. (pdf,ps)

  14. Two-step MIR inequalities for mixed-integer programs, INFORMS Journal on Computing (to appear); IBM Research Report RC23791, 2006. With Oktay Gunluk.

  15. Valid inequalities based on simple mixed-integer sets. Mathematical Programming 105, 2006, 29-53.
    With Oktay Gunluk. Earlier in IPCO X, 2004.(ps)

  16. Valid inequalities based on the interpolation procedure. Mathematical Programming 106, 2006, 111-136.
    With Oktay Gunluk. (pdf, ps).

  17. JPEG compression history estimation for color images. IEEE Transactions on Image Processing 15(6), 2006, 1365-1378. With R.Neelamani, R. de Queiroz, Z. Fan, and R. G. Baraniuk. (pdf)

  18. An exponential lower bound on the length of some classes of branch-and-cut proofs.
    Mathematics of Operations Research 30(3), 2005, 678-700; IPCO 2002.
    Preliminary version in: IBM Research Report RC22575, Sept 2002 (gzipped postscript).

  19. Solution of a min-max vehicle routing problem. INFORMS Journal on Computing 14, 2002, 132-143.
    With David Applegate, William Cook, and Andre Rohe. (pdf, ps, gzipped postscript.)

  20. On the matrix-cut rank of polyhedra. Mathematics of Operations Research 26, February 2001, 19-30.
    With William Cook. (pdf, ps, gzipped postscript).

  21. On the Matrix Cuts of Lovasz and Schrijver and their use in Integer Programming.
    Technical Report TR01-08, Rice University, 2001 (my Ph.D. thesis).

    IBM publications

    Sanjeeb Dash. Exponential lower bounds on the lengths of some classes of branch-and-cut proofs. Mathematics of Operations Research 30(3):678-700, August 2005.

    Oktay Gunluk and Sanjeeb Dash. Valid Inequalities Based on the Interpolation Procedure. Mathematical Programming, April 2005.