Santanu Subhas Dey

Shengding Sun

SIAM J. Optim., March, 2024

2023

Solving sparse principal component analysis with global support.

[BibT_eX]

[DOI]

Math. Program., May, 2023

Lower bounds on the size of general branch-and-bound trees.

[BibT_eX]

[DOI]

Math. Program., March, 2023

Lifting convex inequalities for bipartite bilinear programs.

[BibT_eX]

[DOI]

Xiaoyi Gu

Math. Program., February, 2023

Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021.

[BibT_eX]

[DOI]

Mohit Singh

David P. Williamson

Math. Program., February, 2023

Branch-and-bound solves random binary IPs in poly(n)-time.

[BibT_eX]

[DOI]

Math. Program., 2023

2022

On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations.

[BibT_eX]

[DOI]

Gonzalo Muñoz

Felipe Serrano

SIAM J. Optim., 2022

Cutting Plane Generation through Sparse Principal Component Analysis.

[BibT_eX]

[DOI]

Aleksandr M. Kazachkov

Andrea Lodi

Gonzalo Muñoz

SIAM J. Optim., 2022

Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices.

[BibT_eX]

[DOI]

SIAM J. Optim., 2022

Lower bound on size of branch-and-bound trees for solving lot-sizing problem.

[BibT_eX]

[DOI]

Prachi Shah

Oper. Res. Lett., 2022

Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems.

[BibT_eX]

[DOI]

James R. Luedtke

Nikolaos V. Sahinidis

Math. Program., 2022

Sparse PSD approximation of the PSD cone.

[BibT_eX]

[DOI]

Math. Program., 2022

Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA.

[BibT_eX]

[DOI]

Rahul Mazumder

Oper. Res., 2022

A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid.

[BibT_eX]

[DOI]

Emma Savannah Johnson

INFORMS J. Comput., 2022

Node-based valid inequalities for the optimal transmission switching problem.

[BibT_eX]

[DOI]

Nicole Redder

Discret. Optim., 2022

Complexity of training ReLU neural network.

[BibT_eX]

[DOI]

Digvijay Boob

Guanghui Lan

Discret. Optim., 2022

2021

Branch-and-Bound Solves Random Binary IPs in Polytime.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Approximation Algorithms for Training One-Node ReLU Neural Networks.

[BibT_eX]

[DOI]

Yao Xie

IEEE Trans. Signal Process., 2020

The Convex Hull of a Quadratic Constraint over a Polytope.

[BibT_eX]

[DOI]

Asteroide Santana

SIAM J. Optim., 2020

Subset Selection in Sparse Matrices.

[BibT_eX]

[DOI]

Alberto Del Pia

Robert Weismantel

SIAM J. Optim., 2020

Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming.

[BibT_eX]

[DOI]

Xiaoyi Gu

SIAM J. Optim., 2020

Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem.

[BibT_eX]

[DOI]

Asteroide Santana

J. Glob. Optim., 2020

Optimization-Driven Scenario Grouping.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2020

Branch-and-Bound Solves Random Binary Packing IPs in Polytime.

[BibT_eX]

[DOI]

CoRR, 2020

Upper bounds for Model-Free Row-Sparse Principal Component Analysis.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

Nonunique Lifting of Integer Variables in Minimal Inequalities.

[BibT_eX]

[DOI]

Amitabh Basu

Joseph Paat

SIAM J. Discret. Math., 2019

2018

Improving the Randomization Step in Feasibility Pump.

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

The strength of multi-row aggregation cuts for sign-pattern integer programs.

[BibT_eX]

[DOI]

Andres Iroume

Oper. Res. Lett., 2018

Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem.

[BibT_eX]

[DOI]

Xu Andy Sun

Math. Program. Comput., 2018

Theoretical challenges towards cutting-plane selection.

[BibT_eX]

[DOI]

Math. Program., 2018

Aggregation-based cutting-planes for packing and covering integer programs.

[BibT_eX]

[DOI]

Math. Program., 2018

Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs.

[BibT_eX]

[DOI]

Qianyi Wang

Math. Oper. Res., 2018

Beating the SDP bound for the floor layout problem: a simple combinatorial idea.

[BibT_eX]

[DOI]

Joey Huchette

INFOR Inf. Syst. Oper. Res., 2018

Strong mixed-integer formulations for the floor layout problem.

[BibT_eX]

[DOI]

Joey Huchette

INFOR Inf. Syst. Oper. Res., 2018

2017

Mixed-integer quadratic programming is in NP.

[BibT_eX]

[DOI]

Alberto Del Pia

Math. Program., 2017

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions.

[BibT_eX]

[DOI]

Math. Program., 2017

Relaxations and discretizations for the pooling problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 2017

Some cut-generating functions for second-order conic sets.

[BibT_eX]

[DOI]

Asteroide Santana

Discret. Optim., 2017

2016

Closedness of Integer Hulls of Simple Conic Sets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

On a cardinality-constrained transportation problem with market choice.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2016

A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching.

[BibT_eX]

[DOI]

Oper. Res., 2016

Strong SOCP Relaxations for the Optimal Power Flow Problem.

[BibT_eX]

[DOI]

Xu Andy Sun

Oper. Res., 2016

Improving the Integer L-Shaped Method.

[BibT_eX]

[DOI]

Gustavo Angulo

INFORMS J. Comput., 2016

Strengthened bounds for the probability of k-out-of-n events.

[BibT_eX]

[DOI]

Feng Qiu

Discret. Appl. Math., 2016

2015

Some lower bounds on sparse outer approximations of polytopes.

[BibT_eX]

[DOI]

Andres Iroume

Oper. Res. Lett., 2015

Approximating polyhedra with sparse inequalities.

[BibT_eX]

[DOI]

Qianyi Wang

Math. Program., 2015

Forbidden Vertices.

[BibT_eX]

[DOI]

Math. Oper. Res., 2015

Analysis of MILP Techniques for the Pooling Problem.

[BibT_eX]

[DOI]

Akshay Gupte

Oper. Res., 2015

On the transportation problem with market choice.

[BibT_eX]

[DOI]

Pelin Damci-Kurt

Simge Küçükyavuz

Discret. Appl. Math., 2015

2014

Design and verify: a new scheme for generating cutting-planes.

[BibT_eX]

[DOI]

Sebastian Pokutta

Math. Program., 2014

On the Chvátal-Gomory closure of a compact convex set.

[BibT_eX]

[DOI]

Daniel Dadush

Math. Program., 2014

Semi-continuous network flow problems.

[BibT_eX]

[DOI]

Gustavo Angulo

Math. Program., 2014

Covering Linear Programming with Violations.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2014

On the Practical Strength of Two-Row Tableau Cuts.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2014

On a Cardinality-Constrained Transportation Problem With Market Choice.

[BibT_eX]

[DOI]

Pelin Damci-Kurt

Simge Küçükyavuz

CoRR, 2014

How Good Are Sparse Cutting-Planes?

[BibT_eX]

[DOI]

Qianyi Wang

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

Solving Mixed Integer Bilinear Problems Using MILP Formulations.

[BibT_eX]

[DOI]

SIAM J. Optim., 2013

Some properties of convex hulls of integer points contained in general convex sets.

[BibT_eX]

[DOI]

Diego Alejandro Morán Ramírez

Math. Program., 2013

A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

A Strong Dual for Conic Mixed-Integer Programs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2012

Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra.

[BibT_eX]

[DOI]

Sanjeeb Dash

Oktay Günlük

Math. Program., 2012

2011

On Maximal S-Free Convex Sets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

On mixed-integer sets with two integer variables.

[BibT_eX]

[DOI]

Sanjeeb Dash

Oktay Günlük

Oper. Res. Lett., 2011

The split closure of a strictly convex body.

[BibT_eX]

[DOI]

Daniel Dadush

Oper. Res. Lett., 2011

A note on the split rank of intersection cuts.

[BibT_eX]

[DOI]

Math. Program., 2011

Split Rank of Triangle and Quadrilateral Inequalities.

[BibT_eX]

[DOI]

Quentin Louveaux

Math. Oper. Res., 2011

The Chvátal-Gomory Closure of a Strictly Convex Body.

[BibT_eX]

[DOI]

Daniel Dadush

Math. Oper. Res., 2011

2010

Constrained Infinite Group Relaxations of MIPs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2010

Two row mixed-integer cuts via lifting.

[BibT_eX]

[DOI]

Math. Program., 2010

On the extreme inequalities of infinite group problems.

[BibT_eX]

[DOI]

Yanjun Li

Lisa A. Miller

Math. Program., 2010

Relations between facets of low- and high-dimensional group problems.

[BibT_eX]

[DOI]

Math. Program., 2010

Composite lifting of group inequalities and an application to two-row mixing inequalities.

[BibT_eX]

[DOI]

Discret. Optim., 2010

The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Experiments with Two Row Tableau Cuts.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

The Group-Theoretic Approach in Mixed Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009

Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2009

2008

Facets of Two-Dimensional Infinite Group Problems.

[BibT_eX]

[DOI]

Math. Oper. Res., 2008

Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007

Sequential-Merge Facets for Two-Dimensional Group Problems.

[BibT_eX]

[DOI]