Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Optimización no suave"'
Publikováno v:
Pesquimat; Vol. 25 No. 2 (2022); 70-91
Pesquimat; Vol. 25 Núm. 2 (2022); 70-91
Pesquimat; Vol. 25 Núm. 2 (2022); 70-91
Given the problem of minimizing a possibly non-convex and non-smooth function in Euclidean space, we present an abstract generalized ϵ-descent algorithm. This algorithm is motivated by the abstract convergence of descent methods introduced by Attouc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=4dc99724cf04::a0ef2812a5d0071a502643e7e2e8cfca
https://revistasinvestigacion.unmsm.edu.pe/index.php/matema/article/view/24364
https://revistasinvestigacion.unmsm.edu.pe/index.php/matema/article/view/24364
Publikováno v:
O2, repositorio institucional de la UOC
Universitat Oberta de Catalunya (UOC)
Mathematics
Volume 8
Issue 9
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Mathematics, Vol 8, Iss 1461, p 1461 (2020)
Universitat Oberta de Catalunya (UOC)
Mathematics
Volume 8
Issue 9
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Mathematics, Vol 8, Iss 1461, p 1461 (2020)
In the classical team orienteering problem (TOP), a fixed fleet of vehicles is employed, each of them with a limited driving range. The manager has to decide about the subset of customers to visit, as well as the visiting order (routes). Each custome
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5fb5233546e33dd5fba711adc5705ae
https://hdl.handle.net/2117/328346
https://hdl.handle.net/2117/328346
