|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 5 keywords
|
|
|
|
|
Results
Found 28 publication records. Showing 28 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük |
The master equality polyhedron with multiple rows.  |
Math. Program.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Santanu S. Dey, Oktay Günlük |
On mixed-integer sets with two integer variables. |
Oper. Res. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük, Christian Raack |
A note on the MIR closure and basic relaxations of polyhedra. |
Oper. Res. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash |
Mixed Integer Rounding Cuts and Master Group Polyhedra. |
Combinatorial Optimization - Methods and Applications |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash |
On the complexity of cutting-plane proofs using split cuts. |
Oper. Res. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük, Andrea Lodi |
MIR closures of polyhedral sets. |
Math. Program. |
2010 |
DBLP DOI BibTeX RDF |
Mathematical Subject Classification (2000) 90C10, 90C57, 90C11 |
| 1 | Sanjeeb Dash, Oktay Günlük, Andrea Lodi |
Erratum to: MIR closures of polyhedral sets. |
Math. Program. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük |
On a generalization of the master cyclic group polyhedron. |
Math. Program. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Marcos Goycoolea, Oktay Günlük |
Two-Step MIR Inequalities for Mixed Integer Programs. |
INFORMS Journal on Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Uday Bondhugula, Oktay Günlük, Sanjeeb Dash, Lakshminarayanan Renganarayanan |
A model for fusion and code motion in an automatic parallelizing compiler. |
PACT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük |
On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs. |
SIAM Journal on Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | William Cook, Sanjeeb Dash, Ricardo Fukasawa, Marcos Goycoolea |
Numerically Safe Gomory Mixed-Integer Cuts. |
INFORMS Journal on Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash |
On the complexity of cutting plane proofs using split cuts. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük |
On the strength of Gomory mixed-integer cuts as group cuts. |
Math. Program. |
2008 |
DBLP DOI BibTeX RDF |
Mixed integer rounding, Cyclic group polyhedra, Integer programming, Cutting planes |
| 1 | Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi |
Projected Chvátal-Gomory cuts for mixed integer linear programs. |
Math. Program. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C10, 90C57, 90C11 |
| 1 | David Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza |
Exact solutions to linear programming problems. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Jayant Kalagnanam, Chandra Reddy, Sang Hwa Song |
Production design for plate products in the steel industry. |
IBM Journal of Research and Development |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramesh Neelamani, Sanjeeb Dash, Richard G. Baraniuk |
On Nearly Orthogonal Lattice Bases and Random Lattices. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük, Andrea Lodi |
On the MIR Closure of Polyhedra. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük |
On a Generalization of the Master Cyclic Group Polyhedron. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
integer programming, polyhedral combinatorics |
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük |
Valid inequalities based on simple mixed-integer sets. |
Math. Program. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük |
Valid inequalities based on the interpolation procedure. |
Math. Program. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash |
Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs. |
Math. Oper. Res. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash, Oktay Günlük |
Valid Inequalities Based on Simple Mixed-Integer Sets. |
IPCO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | David Applegate, William J. Cook, Sanjeeb Dash, André Rohe |
Solution of a Min-Max Vehicle Routing Problem. |
INFORMS Journal on Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeeb Dash |
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. |
IPCO |
2002 |
DBLP BibTeX RDF |
|
| 1 | William J. Cook, Sanjeeb Dash |
On the Matrix-Cut Rank of Polyhedra. |
Math. Oper. Res. |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #28 of 28 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")