Strategies for the parallel implementation of metaheuristics
Parallel implementations of metaheuristics appear quite naturally as an effective alternative
to speed up the search for approximate solutions of combinatorial optimization problems …
to speed up the search for approximate solutions of combinatorial optimization problems …
[LIVRE][B] Applications of combinatorial optimization
VT Paschos - 2014 - books.google.com
Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three
major scientific domains: mathematics, theoretical computer science and management. The …
major scientific domains: mathematics, theoretical computer science and management. The …
[PDF][PDF] Optimisation combinatoire parallèle
B Anstreicher - academia.edu
Les progrès réalisés dans le domaine du Parallélisme (Architectures, Systèmes, Langages,
Environnements d'exécution et Algorithmes) pendant la dernière décennie provoquent en …
Environnements d'exécution et Algorithmes) pendant la dernière décennie provoquent en …
Parallel Combinatorial Optimization
VD Cung, B Le Cun, C Roucairol - Applications of …, 2014 - Wiley Online Library
The progress made in the parallelism domain over the last decade has brought about real
advances in combinatorial optimization at the start of the 21st century. This chapter …
advances in combinatorial optimization at the start of the 21st century. This chapter …
13 STRATEGIES FOR THE
Parallel implementations of metaheuristics appear quite naturally as an effective alternative
to speed up the search for approximate solutions of combinatorial optimization problems …
to speed up the search for approximate solutions of combinatorial optimization problems …
[PS][PS] Communication library for parallel architectures
K Varadarajan - 1999 - charm.cs.illinois.edu
Communication optimizations tend to be specific to a particular architecture or an
application. To improve portability and to reduce the cost of develo** parallel applications …
application. To improve portability and to reduce the cost of develo** parallel applications …
[PDF][PDF] Równoległe algorytmy szeregowania zadań produkcyjnych
W Bożejko - 2003 - staff.iiar.pwr.wroc.pl
Zdecydowana większość praktycznych zagadnień szeregowania zadań produkcyjnych
należy do klasy problemów silnie NP-trudnych, czyli takich, dla których nie istnieją algorytmy …
należy do klasy problemów silnie NP-trudnych, czyli takich, dla których nie istnieją algorytmy …
[CITATION][C] Van-Dat Cung¹, Simone L. Martins²
CC Ribeiro, C Roucairol¹ - Essays and Surveys in Metaheuristics, 2002 - Springer