Sanjeeb Dash  Sanjeeb Dash photo       

contact information

Research Staff Member
Thomas J. Watson Research Center, Yorktown Heights, NY USA
  +1dash914dash945dash1273

links

Professional Associations

Professional Associations:  INFORMS  |  Mathematical Optimization Society


 

  1. Lattice closures of polyhedra (2016).  With O. Gunluk, D. A. Moran R. (pdf)
     
  2. On the polyhedrality of closures of multi-branch split sets and other polyhedra with bounded max-facet-width. SIAM Journal on Optimization, accepted (2017). With O. Gunluk, D. A. Moran R. (pdf)
     
  3. A new lift-and-project operator. European Journal on Operational Research, 257, 2016, 420-428.  With M. Bodur, O. Gunluk. (journal link, pdf)

     
  4. Optimization over structured subsets of positive semidefinite matrices via column generation. Discrete Optimization, accepted (2016).  With A. A. Ahmadi, G. Hall. (journal link, pdf)
     
  5. Cutting planes derived from extended LP formulations. Mathematical Programming, 161, 2017, 159-192. With M. Bodur, O. Gunluk. (journal link, pdf) 
     
  6. Strengthened Benders cuts for stochastic integer programs with continuous recourse. Informs Journal on Computing, 29, 2017, 77-91. With M. Bodur, O. Gunluk, J. R. Luedtke. (journal link,pdf), supplementary material (journal link, pdf). Data/instances used in the paper: Data Explanation, CAP1, CAP2, SNIP. 
     
  7. On the polyhedrality of cross and quadrilateral closures. Mathematical Programming, 160, 2016, 245-270. With O. Gunluk, D. A. Moran R. (journal link, pdf) Earlier in: On some generalizations of the split closure. IPCO 2013, Lecture Notes in Computer Science 7801, 2013, 145-156. (pdf
     
  8. The continuous knapsack set. Mathematical Programming, 155, , 471-496. With O. Gunluk, L. Wolsey, (journal link, pdf)
     
     
  9. On quadratic unconstrained binary optimization problems defined on Chimera graphs, Optima 98, 2015, 2-6. With J. F. Puget. (pdf) Earlier in:  A note on QUBO instances defined on Chimera graphs, 2013, arXiv:1306.1202 (version 2).  (test data)
     
     
  10. Learning interpretable classification rules with boolean compressed sensing. 2015. With D. Malioutov, K. Varshney. Earlier in:
    Learning interpretable classification rules using sequential row sampling, ICASSP 2015,
    Screening for learning classification rules via boolean compressed sensing, ICASSP 2014.
     
  11. Computational Experiments with Cross and Crooked Cross Cuts. INFORMS Journal on Computing, 26, 2014, 780-797. With O. Gunluk, J. P. Vielma. (journal link, pdf)
     
  12. On the relative strength of different generalizations of split cuts. Discrete Optimization 16, 2015, 36-50. With O. Gunluk, M. Molinaro. (journal link, pdf)
     
  13. Lattice-free sets, branching disjunctions, and mixed-integer programming. Mathematical Programming 145, 2014, 483-508. With N. B. Dobbs, O. Gunluk. T. J. Nowicki, G. M. Swirszcz. (journal link, pdf )

     

  14.  On t-branch split cuts for mixed-integer programs. Mathematical Programming 141, 2013, 191-199. With O. Gunluk. (journal link,pdf)

     

  15. A time bucket formulation for the TSP with time windows. INFORMS Journal on Computing 24, 2012, 132-147. With A. Lodi, A. Tramontani, O. Gunluk. (journal link, pdf)

     

  16. The master equality polyhedron with multiple rows. Mathematical Programming 132, 2012, 125-152. With R. Fukasawa, O. Gunluk. (journal link, pdf)

     

  17. Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Mathematical Programming, 2012, 135, 221-254. With Santanu S. Dey, Oktay Gunluk. (journal link,pdf)

     

  18. Mixed integer rounding cuts and master group polyhedra. Combinatorial Optimization: Methods and Applications (NATO Science for Peace and Security Series - D: Information and Communication Security, Vol. 31; Ed., V. Chvatal), pp. 1-32, 2011, IOS Press, the Netherlands. Available as IBM Research Report RC24521, 2008.

     

  19. A note on the MIR closure and basic relaxations of polyhedra. Operations Research Letters 39 , 2011, 198-199. With O. Gunluk, C. Raack. (journal link, pdf)

     

  20. On mixed-integer sets with two integer variables. 2010. Operations Research Letters 39 , 2011, 305-309. With Santanu S. Dey, Oktay Gunluk.(journal link, pdf)

     

  21. A heuristic to separate rank-1 GMI cuts. Mathematical Programming Computation 2 , 2010, 231-257. With Marcos Goycoolea. (journal link, pdf)

     

  22. A Model for Fusion and Code Motion in an Integrated Auto-Parallelizing Compiler. 2010. International Conference on Parallel Architectures and Compilation Techniques (PACT), 2010, Vienna. With U. Bondhugula, O. Gunluk, L. Renganarayana.

     

  23. On a generalization of the master cyclic group polyhedron, Mathematical Programming 125, 2010, 1-30; Earlier in IPCO 2007. With R. Fukasawa, O. Gunluk. (journal link, pdf)

     

  24. On the complexity of cutting plane proofs using split cuts. Operations Research Letters 38, 2010, 109-114.(journal link, pdf)

     

  25. MIR closures of polyhedral sets. Mathematical Programming 121, 2010, 33-60. With Oktay Gunluk, Andrea Lodi. Earlier in IPCO 2007. (journal link, pdf)
    Erratum to: MIR closures of polyhedral sets. Mathematical Programming 123, 2010, 485-486.

     

  26. Two-step MIR inequalities for mixed-integer programs. INFORMS Journal on Computing 22 , 2010, 236-249. With Marcos Goycoolea, Oktay Gunluk. (pdf)

     

  27. Numerically accurate Gomory mixed-integer cuts. Informs Journal On Computing 21, 2009, 641-649. With William Cook, Ricardo Fukasawa, Marcos Goycoolea. (pdf)

     

  28. On mixing inequalities: rank, closure and cutting plane proofs. SIAM Journal on Optimization 20, 2009, 1090-1109. With Oktay Gunluk. (pdf)

     

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

     

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

     

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

     

  32. 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)

     

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

     

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

     

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

     

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

     

  37. 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)

     

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

     

  39. 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)

     

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

     

  41. 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).

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 




Technical Areas