| 2008 |
|---|
| 15 | EE | Sanjeeb Dash:
On the complexity of cutting plane proofs using split cuts.
Electronic Colloquium on Computational Complexity (ECCC) 15(084): (2008) |
| 14 | EE | 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) |
| 13 | EE | Sanjeeb Dash,
Oktay Günlük:
On the strength of Gomory mixed-integer cuts as group cuts.
Math. Program. 115(2): 387-407 (2008) |
| 2007 |
|---|
| 12 | EE | Sanjeeb Dash,
Ricardo Fukasawa,
Oktay Günlük:
On a Generalization of the Master Cyclic Group Polyhedron.
IPCO 2007: 197-209 |
| 11 | EE | Sanjeeb Dash,
Oktay Günlük,
Andrea Lodi:
On the MIR Closure of Polyhedra.
IPCO 2007: 337-351 |
| 10 | EE | 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) |
| 9 | EE | David Applegate,
William Cook,
Sanjeeb Dash,
Daniel Espinoza:
Exact solutions to linear programming problems.
Oper. Res. Lett. 35(6): 693-699 (2007) |
| 8 | EE | Ramesh Neelamani,
Sanjeeb Dash,
Richard G. Baraniuk:
On Nearly Orthogonal Lattice Bases and Random Lattices.
SIAM J. Discrete Math. 21(1): 199-219 (2007) |
| 2006 |
|---|
| 7 | EE | 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) |
| 6 | EE | Sanjeeb Dash,
Oktay Günlük:
Valid inequalities based on simple mixed-integer sets.
Math. Program. 105(1): 29-53 (2006) |
| 5 | EE | Sanjeeb Dash,
Oktay Günlük:
Valid inequalities based on the interpolation procedure.
Math. Program. 106(1): 111-136 (2006) |
| 2004 |
|---|
| 4 | EE | Sanjeeb Dash,
Oktay Günlük:
Valid Inequalities Based on Simple Mixed-Integer Sets.
IPCO 2004: 33-45 |
| 2002 |
|---|
| 3 | EE | Sanjeeb Dash:
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs.
IPCO 2002: 145-160 |
| 2 | EE | David Applegate,
William Cook,
Sanjeeb Dash,
André Rohe:
Solution of a Min-Max Vehicle Routing Problem.
INFORMS Journal on Computing 14(2): 132-143 (2002) |
| 2001 |
|---|
| 1 | EE | William Cook,
Sanjeeb Dash:
On the Matrix-Cut Rank of Polyhedra.
Math. Oper. Res. 26(1): 19-30 (2001) |
