( en | de | ru )

 

Disambiguation of "Dey, Santanu S."

Author of the publication

copydeleteadd this publication to your clipboard
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions.

, , , , and . Math. Program., 162 (1-2): 523-535 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Santanu Sarma

Santanu Mukherjee

Santanu Pal

Joseph Dey

Horst Dey

 

Other publications of authors with the same name

Two row mixed-integer cuts via lifting., and . Math. Program., 124 (1-2): 143-174 (2010)On the Chvátal-Gomory closure of a compact convex set., , and . Math. Program., 145 (1-2): 327-348 (2014)The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron., and . IPCO, volume 6080 of Lecture Notes in Computer Science, page 327-340. Springer, (2010)The strength of multi-row aggregation cuts for sign-pattern integer programs., , and . Oper. Res. Lett., 46 (6): 611-615 (2018)Facets of Two-Dimensional Infinite Group Problems., and . Math. Oper. Res., 33 (1): 140-166 (2008)A Strong Dual for Conic Mixed-Integer Programs., , and . SIAM J. Optim., 22 (3): 1136-1150 (2012)Cutting Plane Generation through Sparse Principal Component Analysis., , , and . SIAM J. Optim., 32 (2): 1319-1343 (2022)Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms., and . INFORMS J. Comput., 21 (1): 137-150 (2009)Design and Verify: A New Scheme for Generating Cutting-Planes., and . IPCO, volume 6655 of Lecture Notes in Computer Science, page 143-155. Springer, (2011)A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets., and . IPCO, volume 7801 of Lecture Notes in Computer Science, page 266-277. Springer, (2013)