Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Sanjeeb Dash
2010 – today
- 2013
[c6]Sanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramirez: On Some Generalizations of the Split Closure. IPCO 2013: 145-156- 2012
- [j24]Sanjeeb Dash, Oktay Günlük, Andrea Lodi, Andrea Tramontani: A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. INFORMS Journal on Computing 24(1): 132-147 (2012)
- [j23]Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük: The master equality polyhedron with multiple rows. Math. Program. 132(1-2): 125-151 (2012)
- [j22]Sanjeeb Dash, Santanu S. Dey, Oktay Günlük: Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math. Program. 135(1-2): 221-254 (2012)
- 2011
- [j21]Sanjeeb Dash, Oktay Günlük, Christian Raack: A note on the MIR closure and basic relaxations of polyhedra. Oper. Res. Lett. 39(3): 198-199 (2011)
- [j20]Sanjeeb Dash, Santanu S. Dey, Oktay Günlük: On mixed-integer sets with two integer variables. Oper. Res. Lett. 39(5): 305-309 (2011)
- [p1]Sanjeeb Dash: Mixed Integer Rounding Cuts and Master Group Polyhedra. Combinatorial Optimization - Methods and Applications 2011: 1-32
- 2010
- [j19]Sanjeeb Dash, Marcos Goycoolea, Oktay Günlük: Two-Step MIR Inequalities for Mixed Integer Programs. INFORMS Journal on Computing 22(2): 236-249 (2010)
- [j18]Sanjeeb Dash, Oktay Günlük, Andrea Lodi: MIR closures of polyhedral sets. Math. Program. 121(1): 33-60 (2010)
- [j17]Sanjeeb Dash, Oktay Günlük, Andrea Lodi: Erratum to: MIR closures of polyhedral sets. Math. Program. 123(2): 485-486 (2010)
- [j16]Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük: On a generalization of the master cyclic group polyhedron. Math. Program. 125(1): 1-30 (2010)
- [j15]Sanjeeb Dash, Marcos Goycoolea: A heuristic to generate rank-1 GMI cuts. Math. Program. Comput. 2(3-4): 231-257 (2010)
- [j14]Sanjeeb Dash: On the complexity of cutting-plane proofs using split cuts. Oper. Res. Lett. 38(2): 109-114 (2010)
- [c5]Uday Bondhugula, Oktay Günlük, Sanjeeb Dash, Lakshminarayanan Renganarayanan: A model for fusion and code motion in an automatic parallelizing compiler. PACT 2010: 343-352
2000 – 2009
- 2009
- [j13]William Cook, Sanjeeb Dash, Ricardo Fukasawa, Marcos Goycoolea: Numerically Safe Gomory Mixed-Integer Cuts. INFORMS Journal on Computing 21(4): 641-649 (2009)
- [j12]Sanjeeb Dash, Oktay Günlük: On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs. SIAM Journal on Optimization 20(2): 1090-1109 (2009)
- 2008
- [j11]Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi: Projected Chvátal-Gomory cuts for mixed integer linear programs. Math. Program. 113(2): 241-257 (2008)
- [j10]Sanjeeb Dash, Oktay Günlük: On the strength of Gomory mixed-integer cuts as group cuts. Math. Program. 115(2): 387-407 (2008)
- [i1]Sanjeeb Dash: On the complexity of cutting plane proofs using split cuts. Electronic Colloquium on Computational Complexity (ECCC) 15(084) (2008)
- 2007
- [j9]Sanjeeb Dash, Jayant Kalagnanam, Chandra Reddy, Sang Hwa Song: Production design for plate products in the steel industry. IBM Journal of Research and Development 51(3/4): 345-362 (2007)
- [j8]David Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza: Exact solutions to linear programming problems. Oper. Res. Lett. 35(6): 693-699 (2007)
- [j7]Ramesh Neelamani, Sanjeeb Dash, Richard G. Baraniuk: On Nearly Orthogonal Lattice Bases and Random Lattices. SIAM J. Discrete Math. 21(1): 199-219 (2007)
- [c4]Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük: On a Generalization of the Master Cyclic Group Polyhedron. IPCO 2007: 197-209
- [c3]
- 2006
- [j6]Sanjeeb Dash, Oktay Günlük: Valid inequalities based on simple mixed-integer sets. Math. Program. 105(1): 29-53 (2006)
- [j5]Sanjeeb Dash, Oktay Günlük: Valid inequalities based on the interpolation procedure. Math. Program. 106(1): 111-136 (2006)
- [j4]Ramesh Neelamani, Ricardo L. de Queiroz, Zhigang Fan, Sanjeeb Dash, Richard G. Baraniuk: JPEG compression history estimation for color images. IEEE Transactions on Image Processing 15(6): 1365-1378 (2006)
- 2005
- [j3]Sanjeeb Dash: Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs. Math. Oper. Res. 30(3): 678-700 (2005)
- 2004
- [c2]
- 2002
- [j2]David Applegate, William J. Cook, Sanjeeb Dash, André Rohe: Solution of a Min-Max Vehicle Routing Problem. INFORMS Journal on Computing 14(2): 132-143 (2002)
- [c1]Sanjeeb Dash: An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. IPCO 2002: 145-160
- 2001
- [j1]William J. Cook, Sanjeeb Dash: On the Matrix-Cut Rank of Polyhedra. Math. Oper. Res. 26(1): 19-30 (2001)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-13 19:54 CET by the dblp team