Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Dey, Santanu S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
How good are sparse cutting-planes?
Santanu S. Dey
,
Marco Molinaro
,
Qianyi Wang
Lecture Notes in Computer Science
8494
, 2014, pp. 261-272
A polynomial-time algorithm to check closedness of simple second order mixed-integer sets
Diego Alejandro Morán Ramírez
,
Santanu S. Dey
Lecture Notes in Computer Science
7801
, 2013, pp. 266-277
On the Chvátal-Gomory closure of a compact convex set
Daniel Dadush
,
Santanu S. Dey
,
Juan Pablo Vielma
Lecture Notes in Computer Science
6655
, 2011, pp. 130-142
Design and verify: A new scheme for generating cutting-planes
Santanu S. Dey
,
Sebastian Pokutta
Lecture Notes in Computer Science
6655
, 2011, pp. 143-155
On maximal
S
-free convex sets
Diego A. Morán R.
,
Santanu S. Dey
SIAM Journal on Discrete Mathematics
25
(1), 2011, pp. 379-393
Experiments with two row tableau cuts
Santanu S. Dey
,
Andrea Lodi
,
Andrea Tramontani
,
Laurence A. Wolsey
Lecture Notes in Computer Science
6080
, 2010, pp. 424-437
The Chvátal-Gomory closure of an ellipsoid is a polyhedron
Santanu S. Dey
,
Juan Pablo Vielma
Lecture Notes in Computer Science
6080
, 2010, pp. 327-340
Lifting integer variables in minimal inequalities corresponding to lattice-free triangles
Santanu S. Dey
,
Laurence A. Wolsey
Lecture Notes in Computer Science
5035
, 2008, pp. 463-475
Sequential-merge facets for two-dimensional group problems
Santanu S. Dey
,
Jean-Philippe P. Richard
Lecture Notes in Computer Science
4513
, 2007, pp. 30-42