A very short, very blunt, book note
logicmatters.net·1d
Efficient Probabilistic Planning with Maximum-Coverage Distributionally Robust Backward Reachable Trees
arxiv.org·1d
Progressive Bound Strengthening via Doubly Nonnegative Cutting Planes for Nonconvex Quadratic Programs
arxiv.org·2d
Loading...Loading more...