Search research articles
Contact Us
Filters
Showing results (11-20 of 65) with videos related to
Page
of 7
Sort By:
Mathematical Programming
|
February 27, 2023
A duality based 2-approximation algorithm for maximum agreement forest
Neil Olver, Frans Schalekamp, Suzanne van der Ster, et al.
Mathematical Programming
|
March 3, 2025
Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid
Richard Santiago, Ivan Sergeev, Rico Zenklusen
Mathematical Programming
|
July 29, 2024
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
Elisabeth Gaar, Jon Lee, Ivana Ljubić, et al.
Mathematical Programming
|
April 9, 2019
New algorithms for maximum disjoint paths based on tree-likeness
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
Mathematical Programming
|
November 1, 2021
Tikhonov regularization of a second order dynamical system with Hessian driven damping
Radu Ioan Boţ, Ernö Robert Csetnek, Szilárd Csaba László
Mathematical Programming
|
March 18, 2022
Continuous facility location on graphs
Tim A Hartmann, Stefan Lendl, Gerhard J Woeginger
Mathematical Programming
|
March 18, 2022
A technique for obtaining true approximations for <i>k</i>-center with covering constraints
Georg Anegg, Haris Angelidakis, Adam Kurpisz, et al.
Mathematical Programming
|
October 22, 2016
Optimized first-order methods for smooth convex minimization
Donghwan Kim, Jeffrey A Fessler
Mathematical Programming
|
March 16, 2019
Global optimization in Hilbert space
Boris Houska, Benoît Chachuat
Mathematical Programming
|
January 20, 2025
On the directional asymptotic approach in optimization theory
Matúš Benko, Patrick Mehlitz
Page
of 7
Search research articles
Search
Showing results (11-20 of 65) with videos related to
Sort By:
Page
of 7
Mathematical Programming
|
February 27, 2023
A duality based 2-approximation algorithm for maximum agreement forest
Neil Olver, Frans Schalekamp, Suzanne van der Ster, et al.
Mathematical Programming
|
March 3, 2025
Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid
Richard Santiago, Ivan Sergeev, Rico Zenklusen
Mathematical Programming
|
July 29, 2024
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
Elisabeth Gaar, Jon Lee, Ivana Ljubić, et al.
Mathematical Programming
|
April 9, 2019
New algorithms for maximum disjoint paths based on tree-likeness
Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
Mathematical Programming
|
November 1, 2021
Tikhonov regularization of a second order dynamical system with Hessian driven damping
Radu Ioan Boţ, Ernö Robert Csetnek, Szilárd Csaba László
Mathematical Programming
|
March 18, 2022
Continuous facility location on graphs
Tim A Hartmann, Stefan Lendl, Gerhard J Woeginger
Mathematical Programming
|
March 18, 2022
A technique for obtaining true approximations for <i>k</i>-center with covering constraints
Georg Anegg, Haris Angelidakis, Adam Kurpisz, et al.
Mathematical Programming
|
October 22, 2016
Optimized first-order methods for smooth convex minimization
Donghwan Kim, Jeffrey A Fessler
Mathematical Programming
|
March 16, 2019
Global optimization in Hilbert space
Boris Houska, Benoît Chachuat
Mathematical Programming
|
January 20, 2025
On the directional asymptotic approach in optimization theory
Matúš Benko, Patrick Mehlitz
Page
of 7