The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sanjeeb Dash: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]

  9. On the complexity of cutting plane proofs using split cuts. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002