The following pages link to SCIP-SDP (Q27506):
Displaying 16 items.
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
- Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
- Sensor scheduling for linear systems: A covariance tracking approach (Q2063846) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- Certifiably optimal sparse inverse covariance estimation (Q2205987) (← links)
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization (Q2231331) (← links)
- Algorithms for joint sensor and control nodes selection in dynamic networks (Q2280754) (← links)
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
- Irreducible infeasible subsystems of semidefinite systems (Q2420811) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound (Q4685750) (← links)
- (Q5054600) (← links)
- Mixed-Integer Convex Representability (Q5076722) (← links)
- (Q5236419) (← links)
- A generic optimization framework for resilient systems (Q5882239) (← links)
