Results 61 to 70 of about 91 (84)

New algorithms for maximum disjoint paths based on tree-likeness. [PDF]

open access: yesMath Program, 2018
Fleszar K, Mnich M, Spoerhase J.
europepmc   +1 more source
Some of the next articles are maybe not open access.

Related searches:

Distributionally Robust Stochastic Optimization with Wasserstein Distance

Mathematics of Operations Research, 2023
Anton Kleywegt, Rui Gao
exaly  

Constant along primal rays conjugacies and the l0 pseudonorm

Optimization, 2022
Jean-Philippe Chancelier   +1 more
exaly  

The lasso problem and uniqueness

Electronic Journal of Statistics, 2013
Ryan Tibshirani
exaly  

Degrees of freedom in lasso problems

Annals of Statistics, 2012
Jonathan Taylor, Ryan Tibshirani
exaly  

On the “degrees of freedom” of the lasso

Annals of Statistics, 2007
Trevor Hastie   +2 more
exaly  

Home - About - Disclaimer - Privacy