Search research articles
Contact Us
Filters
Showing results (51-60 of 65) with videos related to
Page
of 7
Sort By:
Mathematical Programming
|
July 5, 2022
Complexity of linear relaxations in integer programming
Gennadiy Averkov, Matthias Schymura
Mathematical Programming
|
May 10, 2022
Local convergence of tensor methods
Nikita Doikov, Yurii Nesterov
Mathematical Programming
|
March 18, 2022
About the complexity of two-stage stochastic IPs
Kim-Manuel Klein
Mathematical Programming
|
March 18, 2022
Fair colorful <i>k</i>-center clustering
Xinrui Jia, Kshiteej Sheth, Ola Svensson
Mathematical Programming
|
March 7, 2022
Complete positivity and distance-avoiding sets
Evan DeCorte, Fernando Mário de Oliveira Filho, Frank Vallentin
Mathematical Programming
|
March 7, 2022
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
Simon Bruggmann, Rico Zenklusen
Mathematical Programming
|
May 1, 2026
A <math><mrow><mfrac><mn>4</mn> <mn>3</mn></mfrac></mrow></math> -approximation for the maximum leaf spanning arborescence problem in DAGs
Meike Neuwohner
Mathematical Programming
|
March 18, 2014
MM Algorithms for Geometric and Signomial Programming
Kenneth Lange, Hua Zhou
Mathematical Programming
|
November 22, 2016
Approximating the Little Grothendieck Problem over the Orthogonal and Unitary Groups
Afonso S Bandeira, Christopher Kennedy, Amit Singer
Mathematical Programming
|
January 13, 2026
Accelerated first-order optimization under nonlinear constraints
Michael Muehlebach, Michael I Jordan
Page
of 7
Search research articles
Search
Showing results (51-60 of 65) with videos related to
Sort By:
Page
of 7
Mathematical Programming
|
July 5, 2022
Complexity of linear relaxations in integer programming
Gennadiy Averkov, Matthias Schymura
Mathematical Programming
|
May 10, 2022
Local convergence of tensor methods
Nikita Doikov, Yurii Nesterov
Mathematical Programming
|
March 18, 2022
About the complexity of two-stage stochastic IPs
Kim-Manuel Klein
Mathematical Programming
|
March 18, 2022
Fair colorful <i>k</i>-center clustering
Xinrui Jia, Kshiteej Sheth, Ola Svensson
Mathematical Programming
|
March 7, 2022
Complete positivity and distance-avoiding sets
Evan DeCorte, Fernando Mário de Oliveira Filho, Frank Vallentin
Mathematical Programming
|
March 7, 2022
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
Simon Bruggmann, Rico Zenklusen
Mathematical Programming
|
May 1, 2026
A <math><mrow><mfrac><mn>4</mn> <mn>3</mn></mfrac></mrow></math> -approximation for the maximum leaf spanning arborescence problem in DAGs
Meike Neuwohner
Mathematical Programming
|
March 18, 2014
MM Algorithms for Geometric and Signomial Programming
Kenneth Lange, Hua Zhou
Mathematical Programming
|
November 22, 2016
Approximating the Little Grothendieck Problem over the Orthogonal and Unitary Groups
Afonso S Bandeira, Christopher Kennedy, Amit Singer
Mathematical Programming
|
January 13, 2026
Accelerated first-order optimization under nonlinear constraints
Michael Muehlebach, Michael I Jordan
Page
of 7