Solving combinatorial optimization problems in parallel : methods and techniques
Solving combinatorial optimization problems can often lead to runtime growing exponentially as a function of the input size. But important real-world problems, industrial applications, and academic research challenges, may demand exact optimal solutions. In such situations, parallel processing can r...
Na minha lista:
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colecção: | Lecture notes in computer science
1054 |
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Solving combinatorial optimization problems in parallel, methods and techniques, Alfonso Ferreira, Panos Pardalos (Eds.), 1996, Berlin, Springer, 1 vol. (274 p.), Lecture notes in computer science, 3-540-61043-X • Solving Combinatorial Optimization Problems in Parallel Methods and Techniques, Texte imprimé, 9783662202500 |
Sumário:
- SCOOP: Solving Combinatorial Optimization problems in parallel
- Parallel approximation of optimization problems
- Randomized parallel algorithms
- Automatic synthesis of parallel algorithms
- An introduction to parallel dynamic programming
- Mapping tree-structured combinatorial optimization problems onto parallel computers
- Towards an abstract parallel branch and bound machine
- Parallel best-first branch- and-bound in discrete optimization: A framework
- Building a parallel branch and bound library
- Parallel algorithms for global optimization problems
- Parallel heuristic search Introductions and a new approach.