Showing results (51-60 of 70) with videos related to
Sort By:
Pageof 7
Mathematical Programming|January 20, 2025
Automated tight Lyapunov analysis for first-order methodsManu Upadhyaya, Sebastian Banert, Adrien B Taylor, et al.Mathematical Programming|June 15, 2022
Noisy tensor completion via the sum-of-squares hierarchyBoaz Barak, Ankur MoitraMathematical Programming|July 5, 2022
Matroid bases with cardinality constraints on the intersectionStefan Lendl, Britta Peis, Veerle TimmermansMathematical Programming|July 5, 2022
Complexity of linear relaxations in integer programmingGennadiy Averkov, Matthias SchymuraMathematical Programming|May 10, 2022
Local convergence of tensor methodsNikita Doikov, Yurii NesterovMathematical Programming|March 18, 2022
About the complexity of two-stage stochastic IPsKim-Manuel KleinMathematical Programming|March 18, 2022
Fair colorful k-center clusteringXinrui Jia, Kshiteej Sheth, Ola SvenssonMathematical Programming|March 7, 2022
Complete positivity and distance-avoiding setsEvan DeCorte, Fernando Mário de Oliveira Filho, Frank VallentinMathematical Programming|March 7, 2022
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpointSimon Bruggmann, Rico ZenklusenMathematical Programming|May 1, 2026
A 4 3 -approximation for the maximum leaf spanning arborescence problem in DAGsMeike NeuwohnerPageof 7