- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problemsTimothy, Lee; John E., MitchellDiscrete Optimization, 2017, 24: 152-169.被引 2
- A New Method for Deriving Robust and Globalized Robust Solutions of Uncertain Linear Conic Optimization Problems Having General Convex Uncertainty SetsBram, Gorissen; Aharon, Ben-Tal; Hans, Blanc; Dick, den HertogSSRN Electronic Journal.
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operatorsYu Hin , Au; Levent, TunçelDiscrete Optimization, 2018, 27: 103-129.被引 2
期刊论文
Optimization over structured subsets of positive semidefinite matrices via column generation
8被引6阅读
