


default search action
Solving Combinatorial Optimization Problems in Parallel 1996
- Afonso Ferreira, Panos M. Pardalos:
Solving Combinatorial Optimization Problems in Parallel - Methods and Techniques. Lecture Notes in Computer Science 1054, Springer 1996, ISBN 3-540-61043-X - Afonso Ferreira, Panos M. Pardalos:
SCOOP: Solving Combinatorial Optimization Problems in Parallel. 1-6 - Daniel P. Bovet, Andrea Clementi, Pierluigi Crescenzi, Riccardo Silvestri:
Parallel approximation of optimization problems. 7-24 - Andrea Clementi, José D. P. Rolim, Erik Urland:
Randomized parallel algorithms. 25-50 - Graham M. Megson, Lucia Rapanotti, Xian Chen:
Automatic synthesis of parallel algorithms. 51-86 - Marc Gengler:
An introduction to parallel dynamic programming. 87-114 - Reinhard Lüling, Burkhard Monien, Alexander Reinefeld, Stefan Tschöke:
Mapping tree-structured combinatorial optimization problems onto parallel computers. 115-144 - Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens:
Towards an abstract parallel branch and bound machine. 145-170 - Ricardo C. Corrêa, Afonso Ferreira:
Parallel best-first branch-and-bound in discrete optimization: a framework. 171-200 - Mohamed Benaïchouche, Van-Dat Cung, Salah Dowaji, Bertrand Le Cun, Thierry Mautor, Catherine Roucairol:
Building a parallel branch and bound library. 201-231 - Panos M. Pardalos, Guoliang Xue, P. D. Panagiotopoulos:
Parallel algorithms for global optimization problems. 232-247 - Per S. Laursen:
Parallel heuristic search - Introductions and a new approach. 248-274

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.