| Publication | Date of Publication | Type |
|---|
The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
Mathematical Programming. Series A. Series B | 2025-01-17 | Paper |
On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems
Journal of Global Optimization | 2024-11-12 | Paper |
On solving MAX-SAT using sum of squares
INFORMS Journal on Computing | 2024-07-29 | Paper |
On Integrality in Semidefinite Programming for Discrete Optimization
SIAM Journal on Optimization | 2024-04-03 | Paper |
Partitioning through projections: strong SDP bounds for large graph partition problems
Computers & Operations Research | 2023-07-04 | Paper |
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
Mathematical Programming. Series A. Series B | 2023-05-25 | Paper |
| On solving the MAX-SAT using sum of squares | 2023-02-14 | Paper |
Mathematical programming models and exact algorithms
The Quadratic Unconstrained Binary Optimization Problem | 2022-11-15 | Paper |
The Maximum k-Colorable Subgraph Problem and Related Problems
INFORMS Journal on Computing | 2022-06-28 | Paper |
SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
INFORMS Journal on Computing | 2022-06-28 | Paper |
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
SIAM Journal on Optimization | 2022-06-17 | Paper |
Lower bounds for the bandwidth problem
Computers & Operations Research | 2022-03-09 | Paper |
| The Chv\'atal-Gomory Procedure for Integer SDPs with Applications in Combinatorial Optimization | 2022-01-25 | Paper |
The linearization problem of a binary quadratic problem and its applications
Annals of Operations Research | 2022-01-24 | Paper |
On solving the densest \(k\)-subgraph problem on large graphs
Optimization Methods & Software | 2021-04-15 | Paper |
On solving the quadratic shortest path problem
INFORMS Journal on Computing | 2021-01-07 | Paper |
SDP-based bounds for the Quadratic Cycle Cover Problem via cutting plane augmented Lagrangian methods and reinforcement learning
(available as arXiv preprint) | 2020-09-08 | Paper |
The quadratic cycle cover problem: special cases and efficient bounds
Journal of Combinatorial Optimization | 2020-04-27 | Paper |
The maximum $k$-colorable subgraph problem and related problems
(available as arXiv preprint) | 2020-01-27 | Paper |
| Facial Reduction for Symmetry Reduced Semidefinite Doubly Nonnegative Programs | 2019-12-21 | Paper |
Lower Bounds for the Bandwidth Problem
(available as arXiv preprint) | 2019-04-14 | Paper |
Graph bisection revisited
Annals of Operations Research | 2018-08-13 | Paper |
Matrix-Lifting Semi-Definite Programming for Detection in Multiple Antenna Systems
IEEE Transactions on Signal Processing | 2018-07-09 | Paper |
Special cases of the quadratic shortest path problem
Journal of Combinatorial Optimization | 2018-04-13 | Paper |
The MIN-cut and vertex separator problem
Computational Optimization and Applications | 2018-02-06 | Paper |
An efficient semidefinite programming relaxation for the graph partition problem
INFORMS Journal on Computing | 2017-03-01 | Paper |
Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
European Journal of Operational Research | 2016-06-24 | Paper |
SDP relaxations for some combinatorial optimization problems
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
INFORMS Journal on Computing | 2016-01-25 | Paper |
New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
Linear Algebra and its Applications | 2015-12-14 | Paper |
On bounding the bandwidth of graphs with symmetry
INFORMS Journal on Computing | 2015-09-11 | Paper |
Semidefinite programming and eigenvalue bounds for the graph partition problem
Mathematical Programming. Series A. Series B | 2015-06-19 | Paper |
On semidefinite programming bounds for graph bandwidth
Optimization Methods & Software | 2013-06-24 | Paper |
Multi-start approach for an integer determinant maximization problem
Optimization | 2013-04-22 | Paper |
On semidefinite programming relaxations of maximum \(k\)-section
Mathematical Programming. Series A. Series B | 2012-12-19 | Paper |
A polynomial optimization approach to constant rebalanced portfolio selection
Computational Optimization and Applications | 2012-12-12 | Paper |
Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
Mathematical Programming. Series A. Series B | 2012-06-26 | Paper |
Clique-based facets for the precedence constrained knapsack problem
Mathematical Programming. Series A. Series B | 2012-06-26 | Paper |
A new library of structured semidefinite programming instances
Optimization Methods & Software | 2012-05-16 | Paper |
Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem
SIAM Journal on Optimization | 2010-06-01 | Paper |
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Exploiting group symmetry in truss topology optimization
Optimization and Engineering | 2009-12-02 | Paper |
On Semidefinite Programming Relaxations of the Traveling Salesman Problem
SIAM Journal on Optimization | 2009-11-27 | Paper |
Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design
Optimization and Engineering | 2009-07-06 | Paper |
On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
European Journal of Combinatorics | 2009-06-17 | Paper |
A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Bounds for the quadratic assignment problem using the bundle method
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
| Recent approaches to the quadratic assignment problem | 2006-08-28 | Paper |
Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
On self-regular IPMs (with comments and rejoinder)
Top | 2005-04-04 | Paper |
| scientific article; zbMATH DE number 1368820 (Why is no real title available?) | 1999-11-24 | Paper |
The quadratic minimum spanning tree problem: lower bounds via extended formulations
(available as arXiv preprint) | N/A | Paper |
On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
(available as arXiv preprint) | N/A | Paper |
Exploiting Symmetries in Optimal Quantum Circuit Design
(available as arXiv preprint) | N/A | Paper |
Cuts and semidefinite liftings for the complex cut polytope
(available as arXiv preprint) | N/A | Paper |
