


default search action
Annals of Operations Research, Volume 90
Volume 90, 1999
- Preface. 0

- Jens Clausen, Michael Perregaard:

On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search. 1-17 - Robert E. Bixby, William J. Cook, Alan Cox, Eva K. Lee:

Computational experience with parallel mixed integerprogramming in a distributed environment. 19-43 - Adrian Brüngger, Ambros Marzetta, K. Fukuda, Jürg Nievergelt:

The parallel search bench ZRAM and its applications. 45-63 - Lakshmi S. Iyer, Jay E. Aronson:

A parallel branch-and-bound methodfor cluster analysis. 65-86 - Hercules Vladimirou, Stavros A. Zenios:

Scalable parallel computations forlarge-scale stochastic programming. 87-129 - Laureano F. Escudero, José Luis de la Fuente, Cristina García, Francisco Javier Prieto:

A parallel computation approach for solvingmultistage stochastic network problems. 131-160 - M. A. H. Dempster, R. T. Thompson:

EVPI-based importance sampling solution proceduresfor multistage stochastic linear programmeson parallel MIMD architectures. 161-184 - M. G. A. Verhoeven, M. E. M. Severens:

Parallel local search for Steiner trees in graphs. 185-202 - Udo Kohlmorgen, Hartmut Schmeck, K. Haase:

Experiences with fine-grainedparallel genetic algorithms. 203-219 - Maciej Drozdowski, Wieslaw Kubiak:

Scheduling parallel tasks withsequential heads and tails. 221-246 - Mireille L. Bougeard, C. D. Caquineau:

Parallel proximal decomposition algorithmsfor robust estimation. 247-270 - S. Berner, K. I. M. McKinnon, C. Millar:

A parallel algorithm for the global minimizationof Gibbs free energy. 271-291 - Robert L. Popp, Krishna R. Pattipati, Yaakov Bar-Shalom:

Distributed- and shared-memory parallelizationsof assignment-based data association formultitarget tracking. 293-322

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














