Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2305-2228
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm ; volume:48 ; number:2 ; day:30 ; month:3 ; year:2020 ; pages:363-376 ; date:6.2020
Vietnam journal of mathematics ; 48, Heft 2 (30.3.2020), 363-376, 6.2020
- Creator
-
Artacho, F. J. Aragón
Campoy, R.
Vuong, P. T.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10013-020-00400-8
- URN
-
urn:nbn:de:101:1-2020080921000918583176
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:46 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Artacho, F. J. Aragón
- Campoy, R.
- Vuong, P. T.
- SpringerLink (Online service)
Other Objects (12)
Correction to: Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm
Engineering an external memory minimum spanning tree algorithm
An FPT Algorithm for Directed Spanning k-Leaf
Simulated annealing algorithm for the robust spanning tree problem
The Boosted DC Algorithm for Linearly Constrained DC Programming
Multiple Strategies Boosted Orca Predation Algorithm for Engineering Optimization Problems
Stochastic spanning
Monitoring Stationarity and Cointegration
Testing for strict stationarity
Coupling, stationarity, and regeneration
Monitoring stationarity and cointegration
Detecting deviations from stationarity
Correction to: Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm
Engineering an external memory minimum spanning tree algorithm
An FPT Algorithm for Directed Spanning k-Leaf
Simulated annealing algorithm for the robust spanning tree problem
The Boosted DC Algorithm for Linearly Constrained DC Programming
Multiple Strategies Boosted Orca Predation Algorithm for Engineering Optimization Problems
Stochastic spanning
Monitoring Stationarity and Cointegration
Testing for strict stationarity
Coupling, stationarity, and regeneration
Monitoring stationarity and cointegration
Detecting deviations from stationarity
Correction to: Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm
Engineering an external memory minimum spanning tree algorithm
An FPT Algorithm for Directed Spanning k-Leaf
Simulated annealing algorithm for the robust spanning tree problem
The Boosted DC Algorithm for Linearly Constrained DC Programming
Multiple Strategies Boosted Orca Predation Algorithm for Engineering Optimization Problems
Stochastic spanning
Monitoring Stationarity and Cointegration
Testing for strict stationarity
Coupling, stationarity, and regeneration
Monitoring stationarity and cointegration