Katalog der Deutschen Nationalbibliothek

Neuigkeiten

Leichte Bedienung, intuitive Suche: Die Betaversion unseres neuen Katalogs ist online! → Zur Betaversion des neuen DNB-Katalogs

 
 
 


Ergebnis der Suche nach: tit all "Covering Algorithm."
im Bestand: Gesamter Bestand

41 - 50 von 56
<< < > >>


Artikel 41 A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
Enthalten in Operational Research Society: Journal of the Operational Research Society Bd. 53, 27.6.2002, Nr. 7, date:7.2002: 792-799
Online Ressource
Artikel 42 A Scratch Covering Algorithm Using Affine Projection Method
Enthalten in Mathematics in computer science Bd. 12, 28.5.2018, Nr. 2, date:6.2018: 235-246
Online Ressource
Artikel 43 A solution method to maximal covering location problem based on chemical reaction optimization (CRO) algorithm
Enthalten in Soft computing Bd. 27, 20.3.2023, Nr. 11, date:6.2023: 7337-7361
Online Ressource
Artikel 44 A tolerance-based memetic algorithm for constrained covering array generation
Enthalten in Memetic computing Bd. 15, 29.8.2023, Nr. 3, date:9.2023: 319-340
Online Ressource
Artikel 45 Algorithm for computing the covering constant of a linear operator on a cone
Enthalten in Computational mathematics and mathematical physics Bd. 56, 6.9.2016, Nr. 8, date:8.2016: 1373-1381
Online Ressource
Artikel 46 An Accelerated Benders Decomposition Algorithm for Solving a Double-Type Double-Standard Maximal Covering Location Problem
Enthalten in Operations research forum Bd. 2, 15.3.2021, Nr. 1, date:3.2021: 1-24
Online Ressource
Artikel 47 An analysis of parallel routing algorithm on hypercube network by employing covering problem and assignment problem
Enthalten in Korean journal of computational & applied mathematics Bd. 4, 17.12.2008, Nr. 2, date:8.1997: 475-483
Online Ressource
Artikel 48 An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
Enthalten in Computational and applied mathematics Bd. 39, 29.10.2019, Nr. 1, date:3.2020: 1-21
Online Ressource
Artikel 49 An improved approximation algorithm for covering vertices by $$4^+$$ 4 + -paths
Enthalten in Journal of combinatorial optimization Bd. 49, 11.4.2025, Nr. 3, date:4.2025: 1-29
Online Ressource
Artikel 50 An indirect genetic algorithm for set covering problems
Enthalten in Operational Research Society: Journal of the Operational Research Society Bd. 53, 1.10.2002, Nr. 10, date:10.2002: 1118-1126
Online Ressource


41 - 50 von 56
<< < > >>


E-Mail-IconAdministration