Afonso Ferreira, Panos M. Pardalos (Eds.):
Solving Combinatorial Optimization Problems in Parallel - Methods and Techniques.
Lecture Notes in Computer Science 1054 Springer 1996, ISBN 3-540-61043-X BibTeX
@proceedings{DBLP:conf/scoop/1996,
editor = {Afonso Ferreira and
Panos M. Pardalos},
title = {Solving Combinatorial Optimization Problems in Parallel - Methods
and Techniques},
booktitle = {Solving Combinatorial Optimization Problems in Parallel},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1054},
year = {1996},
isbn = {3-540-61043-X},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Afonso Ferreira, Panos M. Pardalos:
SCOOP: Solving Combinatorial Optimization Problems in Parallel.
1-6 BibTeX
- Daniel P. Bovet, Andrea E. F. Clementi, Pierluigi Crescenzi, Riccardo Silvestri:
Parallel approximation of optimization problems.
7-24 BibTeX
- Andrea E. F. Clementi, José D. P. Rolim, Erik Urland:
Randomized parallel algorithms.
25-50 BibTeX
- Graham M. Megson, L. Rapanotti, Xian Chen:
Automatic synthesis of parallel algorithms.
51-86 BibTeX
- Marc Gengler:
An introduction to parallel dynamic programming.
87-114 BibTeX
- Reinhard Lüling, Burkhard Monien, Alexander Reinefeld, Stefan Tschöke:
Mapping tree-structured combinatorial optimization problems onto parallel computers.
115-144 BibTeX
- Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens:
Towards an abstract parallel branch and bound machine.
145-170 BibTeX
- Ricardo C. Corrêa, Afonso Ferreira:
Parallel best-first branch-and-bound in discrete optimization: a framework.
171-200 BibTeX
- Mohamed Benaïchouche, Van-Dat Cung, Salah Dowaji, Bertrand Le Cun, Thierry Mautor, Catherine Roucairol:
Building a parallel branch and bound library.
201-231 BibTeX
- Panos M. Pardalos, Guoliang Xue, P. D. Panagiotopoulos:
Parallel algorithms for global optimization problems.
232-247 BibTeX
- Per S. Laursen:
Parallel heuristic search - Introductions and a new approach.
248-274 BibTeX
Copyright © Sat May 16 23:37:07 2009
by Michael Ley (ley@uni-trier.de)