| Publication | Date of Publication | Type |
|---|
| Tight SDP relaxations for cardinality-constrained problems | 2024-09-17 | Paper |
Strong SDP based bounds on the cutwidth of a graph
Computers & Operations Research | 2023-11-15 | Paper |
Partitioning through projections: strong SDP bounds for large graph partition problems
Computers & Operations Research | 2023-07-04 | Paper |
A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
INFOR: Information Systems and Operational Research | 2023-05-09 | Paper |
BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
ACM Transactions on Mathematical Software | 2023-03-22 | Paper |
SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
INFORMS Journal on Computing | 2022-09-19 | Paper |
\texttt{EXPEDIS}: an exact penalty method over discrete sets
Discrete Optimization | 2022-06-09 | Paper |
SDP-based bounds for graph partition via extended ADMM
Computational Optimization and Applications | 2022-04-12 | Paper |
An SDP-based approach for computing the stability number of a graph
Mathematical Methods of Operations Research | 2022-04-08 | Paper |
| Security games over lexicographic orders | 2021-12-08 | Paper |
Improving ADMMs for solving doubly nonnegative programs through dual factorization
4OR | 2021-11-04 | Paper |
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
Journal of Symbolic Computation | 2021-06-03 | Paper |
SOS-SDP: an Exact Solver for Minimum Sum-of-Squares Clustering
(available as arXiv preprint) | 2021-04-23 | Paper |
BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints
(available as arXiv preprint) | 2020-09-14 | Paper |
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
BiqBin: moving boundaries for NP-hard problems by HPC
Advances in High Performance Computing | 2020-09-03 | Paper |
Using a factored dual in augmented Lagrangian methods for semidefinite programming
Operations Research Letters | 2020-02-10 | Paper |
EXPEDIS: An Exact Penalty Method over Discrete Sets
(available as arXiv preprint) | 2019-12-20 | Paper |
QPLIB: a library of quadratic programming instances
Mathematical Programming Computation | 2019-12-19 | Paper |
SDP-based branch-and-bound for non-convex quadratic integer optimization
Journal of Global Optimization | 2019-05-23 | Paper |
Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
INFORMS Journal on Computing | 2017-10-04 | Paper |
| On time complexity of semidefinite programs arising in polynomial optimization | 2017-03-07 | Paper |
Exact solution methods for the \(k\)-item quadratic knapsack problem
Lecture Notes in Computer Science | 2016-11-30 | Paper |
A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Computational approaches to MAX-cut
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
Solving \(k\)-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
Semidefinite relaxations for non-convex quadratic mixed-integer programming
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
Exact algorithms for the quadratic linear ordering problem
INFORMS Journal on Computing | 2012-07-28 | Paper |
Regularization methods for semidefinite programming
SIAM Journal on Optimization | 2010-03-17 | Paper |
Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
A boundary point method to solve semidefinite programs
Computing | 2007-01-08 | Paper |
Tight SDP relaxations for cardinality-constrained problems
(available as arXiv preprint) | N/A | Paper |
Computing the Edge Expansion of a Graph using SDP
(available as arXiv preprint) | N/A | Paper |
