On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search J. ClausenM. Perregaard OriginalPaper Pages: 1 - 17
Computational experience with parallel mixed integerprogramming in a distributed environment R.E. BixbyW. CookE.K. Lee OriginalPaper Pages: 19 - 43
The parallel search bench ZRAM and its applications A. BrünggerA. MarzettaJ. Nievergelt OriginalPaper Pages: 45 - 63
A parallel branch‐and‐bound methodfor cluster analysis L.S. IyerJ.E. Aronson OriginalPaper Pages: 65 - 86
Scalable parallel computations forlarge-scale stochastic programming H. VladimirouS.A. Zenios OriginalPaper Pages: 87 - 129
A parallel computation approach for solvingmultistage stochastic network problems L.F. EscuderoJ.L. De La FuenteF.J. Prieto OriginalPaper Pages: 131 - 160
EVPI‐based importance sampling solution proceduresfor multistage stochastic linear programmeson parallel MIMD architectures M.A.H. DempsterR.T. Thompson OriginalPaper Pages: 161 - 184
Parallel local search for Steiner trees in graphs M.G.A. VerhoevenM.E.M. Severens OriginalPaper Pages: 185 - 202
Experiences with fine‐grainedparallel genetic algorithms U. KohlmorgenH. SchmeckK. Haase OriginalPaper Pages: 203 - 219
Scheduling parallel tasks withsequential heads and tails M. DrozdowskiW. Kubiak OriginalPaper Pages: 221 - 246
Parallel proximal decomposition algorithmsfor robust estimation M.L. BougeardC.D. Caquineau OriginalPaper Pages: 247 - 270
A parallel algorithm for the global minimizationof Gibbs free energy S. BernerK.I.M. McKinnonC. Millar OriginalPaper Pages: 271 - 291
Distributed‐ and shared‐memory parallelizationsof assignment‐based data association formultitarget tracking R.L. PoppK.R. PattipatiY. Bar-Shalom OriginalPaper Pages: 293 - 322