Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions
From MaRDI portal
Publication:4202468
DOI10.1287/ijoc.5.1.2zbMath0775.65029OpenAlexW2159224170MaRDI QIDQ4202468
Richard S. Barr, Betty L. Hickman
Publication date: 31 August 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.5.1.2
Related Items (11)
Parallel variable neighborhood search for the min–max order batching problem ⋮ Best practices for comparing optimization algorithms ⋮ Pseudo expected improvement criterion for parallel EGO algorithm ⋮ Designing and reporting on computational experiments with heuristic methods ⋮ Parallel radial basis function methods for the global optimization of expensive functions ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives ⋮ Parallel Solution Methods for Vehicle Routing Problems ⋮ Parallel metaheuristics: recent advances and new trends ⋮ An application of parallel virtual machine framework to film production problem ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding
This page was built for publication: Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions
