Search the dblp DataBase
Sanjeeb Dash :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Sanjeeb Dash An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. [Citation Graph (0, 0)][DBLP ] IPCO, 2002, pp:145-160 [Conf ] Sanjeeb Dash , Oktay Günlük Valid Inequalities Based on Simple Mixed-Integer Sets. [Citation Graph (0, 0)][DBLP ] IPCO, 2004, pp:33-45 [Conf ] David Applegate , William Cook , Sanjeeb Dash , André Rohe Solution of a Min-Max Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP ] INFORMS Journal on Computing, 2002, v:14, n:2, pp:132-143 [Journal ] William Cook , Sanjeeb Dash On the Matrix-Cut Rank of Polyhedra. [Citation Graph (0, 0)][DBLP ] Math. Oper. Res., 2001, v:26, n:1, pp:19-30 [Journal ] Sanjeeb Dash , Oktay Günlük Valid inequalities based on simple mixed-integer sets. [Citation Graph (0, 0)][DBLP ] Math. Program., 2006, v:105, n:1, pp:29-53 [Journal ] Sanjeeb Dash , Oktay Günlük Valid inequalities based on the interpolation procedure. [Citation Graph (0, 0)][DBLP ] Math. Program., 2006, v:106, n:1, pp:111-136 [Journal ] Sanjeeb Dash , Ricardo Fukasawa , Oktay Günlük On a Generalization of the Master Cyclic Group Polyhedron. [Citation Graph (0, 0)][DBLP ] IPCO, 2007, pp:197-209 [Conf ] Sanjeeb Dash , Oktay Günlük , Andrea Lodi On the MIR Closure of Polyhedra. [Citation Graph (0, 0)][DBLP ] IPCO, 2007, pp:337-351 [Conf ] On the complexity of cutting plane proofs using split cuts. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs