Cited in
(30)- A framework for solving mixed-integer semidefinite programs
- Polyhedral approximation in mixed-integer convex optimization
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- Certifiably optimal sparse inverse covariance estimation
- GeoSteiner
- FIR toolbox
- ParaXpress
- SCIP-Jack
- OpenGM
- BOB
- PPBB
- extended-MIQCP
- Optimal-SPCA
- Sieve-SDP
- Pajarito
- frlib
- FrankWolfe.jl
- Mixed-integer convex representability
- Algorithms for joint sensor and control nodes selection in dynamic networks
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- Sensor scheduling for linear systems: A covariance tracking approach
- Gravity
- Outer approximation with conic certificates for mixed-integer convex problems
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
- A generic optimization framework for resilient systems
- Computational mixed-integer semidefinite programming
- The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound
- Irreducible infeasible subsystems of semidefinite systems
This page was built for software: SCIP-SDP
