Pages that link to "Item:Q2301146"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146):
Displaying 16 items.
- On \(t\)-branch split cuts for mixed-integer programs (Q378102) (← links)
- Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Nutmeg: a MIP and CP hybrid solver using branch-and-check (Q2226478) (← links)
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization (Q2231331) (← links)
- Towards understanding sensor and control nodes selection in nonlinear dynamic systems: Lyapunov theory meets branch-and-bound (Q2665710) (← links)
- (Q4414642) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- (Q4735935) (← links)
- (Q5054600) (← links)
- Integer Programming and Combinatorial Optimization (Q5712451) (← links)
- Ellipsoidal buffered area under the curve maximization model with variable selection in credit risk estimation (Q6067195) (← links)
- Cardinality-constrained distributionally robust portfolio optimization (Q6112845) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)
