| Publication | Date of Publication | Type |
|---|
A reformulation-enumeration MINLP algorithm for gas network design
Journal of Global Optimization | 2024-11-12 | Paper |
Solving sparse separable bilinear programs using lifted bilinear cover inequalities
INFORMS Journal on Computing | 2024-07-29 | Paper |
A theoretical and computational analysis of full strong-branching
Mathematical Programming. Series A. Series B | 2024-04-09 | Paper |
Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity
SIAM Journal on Optimization | 2024-01-17 | Paper |
| scientific article; zbMATH DE number 7788373 (Why is no real title available?) | 2024-01-15 | Paper |
| Sensitivity analysis for mixed binary quadratic programming | 2023-12-10 | Paper |
Branch-and-bound solves random binary IPs in poly\((n)\)-time
Mathematical Programming. Series A. Series B | 2023-05-25 | Paper |
Solving sparse principal component analysis with global support
Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
Node-based valid inequalities for the optimal transmission switching problem
Discrete Optimization | 2023-03-29 | Paper |
Strong mixed-integer formulations for the floor layout problem
INFOR: Information Systems and Operational Research | 2023-03-15 | Paper |
Beating the SDP bound for the floor layout problem: a simple combinatorial idea
INFOR: Information Systems and Operational Research | 2023-03-15 | Paper |
Lifting convex inequalities for bipartite bilinear programs
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Lower bounds on the size of general branch-and-bound trees
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
Lower bound on size of branch-and-bound trees for solving lot-sizing problem
Operations Research Letters | 2022-10-17 | Paper |
Approximation Algorithms for Training One-Node ReLU Neural Networks
IEEE Transactions on Signal Processing | 2022-09-23 | Paper |
A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid
INFORMS Journal on Computing | 2022-09-19 | Paper |
| Exploiting Instance and Variable Similarity to Improve Learning-Enhanced Branching | 2022-08-21 | Paper |
Using \(\ell_1\)-relaxation and integer programming to obtain dual bounds for sparse PCA
Operations Research | 2022-08-05 | Paper |
Estimating parameters of mixtures of multivariate \(t\)-populations and application to classification of observations
Journal of Computational and Applied Mathematics | 2022-08-04 | Paper |
| Solving sparse separable bilinear programs using lifted bilinear cover inequalities | 2022-07-30 | Paper |
Rokhlin property for group actions on Hilbert \(C^*\)-modules
Southeast Asian Bulletin of Mathematics | 2022-07-01 | Paper |
Rokhlin property for group actions on Hilbert \(C^*\)-modules
Southeast Asian Bulletin of Mathematics | 2022-07-01 | Paper |
Cutting plane generation through sparse principal component analysis
SIAM Journal on Optimization | 2022-06-17 | Paper |
Complexity of training ReLU neural network
Discrete Optimization | 2022-06-09 | Paper |
Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices
SIAM Journal on Optimization | 2022-04-29 | Paper |
On obtaining the convex hull of quadratic inequalities via aggregations
SIAM Journal on Optimization | 2022-04-29 | Paper |
| scientific article; zbMATH DE number 7500312 (Why is no real title available?) | 2022-03-30 | Paper |
scientific article; zbMATH DE number 7500312 (Why is no real title available?)
(available as arXiv preprint) | 2022-03-30 | Paper |
Sparse PSD approximation of the PSD cone
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Node-based valid inequalities for the optimal transmission switching problem
(available as arXiv preprint) | 2021-12-25 | Paper |
Lifting convex inequalities for bipartite bilinear programs
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
Lower bound on size of branch-and-bound trees for solving lot-sizing problem
(available as arXiv preprint) | 2021-12-07 | Paper |
Inference on parameters of Watson distributions and application to classification of observations
Journal of Computational and Applied Mathematics | 2021-11-24 | Paper |
Comparing geometric discord and negativity for bipartite states
Physics Letters. A | 2021-10-12 | Paper |
Lower Bounds on the Size of General Branch-and-Bound Trees
(available as arXiv preprint) | 2021-03-17 | Paper |
Exact augmented Lagrangian duality for mixed integer quadratic programming
SIAM Journal on Optimization | 2021-03-11 | Paper |
Optimization-Driven Scenario Grouping
INFORMS Journal on Computing | 2021-01-07 | Paper |
| Using Submodularity within Column Generation to Solve the Flight-to-Gate Assignment Problem | 2020-11-11 | Paper |
The convex hull of a quadratic constraint over a polytope
SIAM Journal on Optimization | 2020-11-09 | Paper |
The order-\(n\) minors of certain \((n+k)\times n\) matrices
Linear Algebra and its Applications | 2020-08-28 | Paper |
Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
Journal of Global Optimization | 2020-05-04 | Paper |
Subset selection in sparse matrices
SIAM Journal on Optimization | 2020-04-24 | Paper |
| A K-Nearest Neighbor Heuristic for Real-Time DC Optimal Transmission Switching | 2020-03-23 | Paper |
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
Mathematics of Operations Research | 2020-03-11 | Paper |
The strength of multi-row aggregation cuts for sign-pattern integer programs
Operations Research Letters | 2020-02-10 | Paper |
| Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization | 2020-01-21 | Paper |
New SOCP relaxation and branching rule for bipartite bilinear programs
Optimization and Engineering | 2019-10-29 | Paper |
Bures distance and transition probability for \(\alpha\)-CPD-kernels
Complex Analysis and Operator Theory | 2019-07-18 | Paper |
Nonunique lifting of integer variables in minimal inequalities
SIAM Journal on Discrete Mathematics | 2019-05-13 | Paper |
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
Mathematical Programming Computation | 2019-05-03 | Paper |
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
SIAM Journal on Optimization | 2019-01-14 | Paper |
| An Approximation Algorithm for training One-Node ReLU Neural Network | 2018-10-08 | Paper |
On a cardinality-constrained transportation problem with market choice
Operations Research Letters | 2018-10-01 | Paper |
Some lower bounds on sparse outer approximations of polytopes
Operations Research Letters | 2018-09-28 | Paper |
Aggregation-based cutting-planes for packing and covering integer programs
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
Incorporating views on marginal distributions in the calibration of risk models
Operations Research Letters | 2018-09-28 | Paper |
Characteristic functions of liftings. II
Operators and Matrices | 2018-07-18 | Paper |
Theoretical challenges towards cutting-plane selection
Mathematical Programming. Series A. Series B | 2018-07-13 | Paper |
Some cut-generating functions for second-order conic sets
Discrete Optimization | 2018-05-24 | Paper |
Improving the randomization step in feasibility pump
SIAM Journal on Optimization | 2018-02-14 | Paper |
| Sparse principal component analysis and its $l_1$-relaxation | 2017-12-03 | Paper |
KSGNS construction for \(\tau\)-maps on S-modules and \(\mathfrak{K}\)-families
Operators and Matrices | 2017-10-06 | Paper |
\(\mathfrak{K}\)-families and CPD-H-extendable families
Rocky Mountain Journal of Mathematics | 2017-07-11 | Paper |
\(\mathfrak{K}\)-families and CPD-H-extendable families
Rocky Mountain Journal of Mathematics | 2017-07-11 | Paper |
Mixed-integer quadratic programming is in NP
Mathematical Programming. Series A. Series B | 2017-03-23 | Paper |
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
Mathematical Programming. Series A. Series B | 2017-03-23 | Paper |
Relaxations and discretizations for the pooling problem
Journal of Global Optimization | 2017-03-03 | Paper |
On the practical strength of two-row tableau cuts
INFORMS Journal on Computing | 2017-02-17 | Paper |
Strong SOCP relaxations for the optimal power flow problem
Operations Research | 2017-01-26 | Paper |
Improving the integer L-shaped method
INFORMS Journal on Computing | 2016-11-01 | Paper |
A cycle-based formulation and valid inequalities for DC power transmission problems with switching
Operations Research | 2016-10-31 | Paper |
Groves mechanisms and communication externalities
Review of Economic Design | 2016-05-13 | Paper |
Beating the SDP bound for the floor layout problem: A simple combinatorial idea
(available as arXiv preprint) | 2016-02-25 | Paper |
Closedness of integer hulls of simple conic sets
SIAM Journal on Discrete Mathematics | 2016-01-15 | Paper |
Approximating polyhedra with sparse inequalities
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Strengthened bounds for the probability of \(k\)-out-of-\(n\) events
Discrete Applied Mathematics | 2015-12-07 | Paper |
Analysis of MILP techniques for the pooling problem
Operations Research | 2015-11-20 | Paper |
| New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem | 2015-10-07 | Paper |
Generalized repeated interaction model and transfer functions
Operator Theory in Harmonic and Non-commutative Analysis | 2015-09-07 | Paper |
Functional models and minimal contractive liftings
Complex Analysis and Operator Theory | 2015-06-18 | Paper |
Forbidden vertices
Mathematics of Operations Research | 2015-05-29 | Paper |
Covering linear programming with violations
INFORMS Journal on Computing | 2015-01-27 | Paper |
On the transportation problem with market choice
Discrete Applied Mathematics | 2014-12-05 | Paper |
| Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow | 2014-10-03 | Paper |
On the Chvátal-Gomory closure of a compact convex set
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
Semi-continuous network flow problems
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
Design and verify: a new scheme for generating cutting-planes
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
How good are sparse cutting-planes?
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Some properties of convex hulls of integer points contained in general convex sets
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
Solving mixed integer bilinear problems using MILP formulations
SIAM Journal on Optimization | 2013-09-25 | Paper |
A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
A strong dual for conic mixed-integer programs
SIAM Journal on Optimization | 2013-01-04 | Paper |
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Linear-programming-based lifting and its application to primal cutting-plane algorithms
INFORMS Journal on Computing | 2012-07-28 | Paper |
Composite lifting of group inequalities and an application to two-row mixing inequalities
Discrete Optimization | 2012-06-20 | Paper |
Split rank of triangle and quadrilateral inequalities
Mathematics of Operations Research | 2012-05-24 | Paper |
The Chvátal-Gomory closure of a strictly convex body
Mathematics of Operations Research | 2012-05-24 | Paper |
On mixed-integer sets with two integer variables
Operations Research Letters | 2012-04-05 | Paper |
Standard commuting dilations and liftings
Colloquium Mathematicum | 2012-04-02 | Paper |
A note on the split rank of intersection cuts
Mathematical Programming. Series A. Series B | 2011-11-23 | Paper |
On maximal \(S\)-free convex sets
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
The split closure of a strictly convex body
Operations Research Letters | 2011-08-09 | Paper |
Design and verify: A new scheme for generating cutting-planes
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
On the Chvátal-Gomory closure of a compact convex set
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Characteristic functions of liftings
(available as arXiv preprint) | 2011-04-06 | Paper |
Constrained infinite group relaxations of MIPs
SIAM Journal on Optimization | 2011-03-21 | Paper |
Liftings of covariant representations of \(W^*\)-correspondences
Infinite Dimensional Analysis, Quantum Probability and Related Topics | 2010-11-18 | Paper |
Two row mixed-integer cuts via lifting
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Experiments with two row tableau cuts
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
The group-theoretic approach in mixed integer programming
50 Years of Integer Programming 1958-2008 | 2010-06-03 | Paper |
Relations between facets of low- and high-dimensional group problems
Mathematical Programming. Series A. Series B | 2010-04-15 | Paper |
On the extreme inequalities of infinite group problems
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Facets of Two-Dimensional Infinite Group Problems
Mathematics of Operations Research | 2008-05-27 | Paper |
Sequential-Merge Facets for Two-Dimensional Group Problems
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Characteristic functions for ergodic tuples
Integral Equations and Operator Theory | 2007-10-22 | Paper |
Minimal Cuntz--Krieger dilations and representations of Cuntz--Krieger algebras
Proceedings of the Indian Academy of Sciences. Mathematical Sciences | 2007-08-29 | Paper |
Standard dilations of q-commuting tuples
Colloquium Mathematicum | 2007-01-10 | Paper |
Standard noncommuting and commuting dilations of commuting tuples
Transactions of the American Mathematical Society | 2004-01-07 | Paper |
A reformulation-enumeration MINLP algorithm for gas network design
(available as arXiv preprint) | N/A | Paper |
On Sparse Canonical Correlation Analysis
(available as arXiv preprint) | N/A | Paper |
Regularized MIP Model for Optimal Power Flow with Energy Storage Systems and its Applications
(available as arXiv preprint) | N/A | Paper |
Non-Monotonicity of Branching Rules with respect to Linear Relaxations
(available as arXiv preprint) | N/A | Paper |
