Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Mathematical programming

Showing results (41-50 of 65) with videos related to

Pageof 7
Sort By:
Mathematical Programming|March 3, 2025
A nearly optimal randomized algorithm for explorable heap selectionSander Borst, Daniel Dadush, Sophie Huiberts, et al.
Mathematical Programming|March 3, 2025
Configuration balancing for stochastic requestsFranziska Eberle, Anupam Gupta, Nicole Megow, et al.
Mathematical Programming|February 12, 2024
Phragmén's voting methods and justified representationMarkus Brill, Rupert Freeman, Svante Janson, et al.
Mathematical Programming|February 19, 2024
Diverse collections in matroids and graphsFedor V Fomin, Petr A Golovach, Fahad Panolan, et al.
Mathematical Programming|October 18, 2024
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methodsMasoud Ahookhosh, Yurii Nesterov
Mathematical Programming|May 1, 2026
A better-than-1.6-approximation for prize-collecting TSPJannis Blauth, Nathan Klein, Martin Nägele
Mathematical Programming|May 1, 2026
A first order method for linear programming parameterized by circuit imbalanceRichard Cole, Christoph Hertrich, Yixin Tao, et al.
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 Moitra
Mathematical Programming|July 5, 2022
Matroid bases with cardinality constraints on the intersectionStefan Lendl, Britta Peis, Veerle Timmermans
Pageof 7

Showing results (41-50 of 65) with videos related to

Sort By:
Pageof 7
Mathematical Programming|March 3, 2025
A nearly optimal randomized algorithm for explorable heap selectionSander Borst, Daniel Dadush, Sophie Huiberts, et al.
Mathematical Programming|March 3, 2025
Configuration balancing for stochastic requestsFranziska Eberle, Anupam Gupta, Nicole Megow, et al.
Mathematical Programming|February 12, 2024
Phragmén's voting methods and justified representationMarkus Brill, Rupert Freeman, Svante Janson, et al.
Mathematical Programming|February 19, 2024
Diverse collections in matroids and graphsFedor V Fomin, Petr A Golovach, Fahad Panolan, et al.
Mathematical Programming|October 18, 2024
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methodsMasoud Ahookhosh, Yurii Nesterov
Mathematical Programming|May 1, 2026
A better-than-1.6-approximation for prize-collecting TSPJannis Blauth, Nathan Klein, Martin Nägele
Mathematical Programming|May 1, 2026
A first order method for linear programming parameterized by circuit imbalanceRichard Cole, Christoph Hertrich, Yixin Tao, et al.
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 Moitra
Mathematical Programming|July 5, 2022
Matroid bases with cardinality constraints on the intersectionStefan Lendl, Britta Peis, Veerle Timmermans
Pageof 7