Parallel computational optimization in operations research: A new integrative framework, literature review and research directions
G Schryen - European Journal of Operational Research, 2020 - Elsevier
Solving optimization problems with parallel algorithms has a long tradition in OR. Its future
relevance for solving hard optimization problems in many fields, including finance, logistics …
relevance for solving hard optimization problems in many fields, including finance, logistics …
Recent advances on GPU computing in operations research
In the last decade, Graphics Processing Units (GPUs) have gained an increasing popularity
as accelerators for High Performance Computing (HPC) applications. Recent GPUs are not …
as accelerators for High Performance Computing (HPC) applications. Recent GPUs are not …
GPU implementation of the branch and bound method for knapsack problems
In this paper, we propose an efficient implementation of the branch and bound method for
knapsack problems on a CPU-GPU system via CUDA. Branch and bound computations can …
knapsack problems on a CPU-GPU system via CUDA. Branch and bound computations can …
Parallel global optimization on GPU
K Barkalov, V Gergel - Journal of Global Optimization, 2016 - Springer
This work considers a parallel algorithm for solving multidimensional multiextremal
optimization problems. This algorithm uses Peano-type space filling curves for dimension …
optimization problems. This algorithm uses Peano-type space filling curves for dimension …
GPU‐based branch‐and‐bound method to solve large 0‐1 knapsack problems with data‐centric strategies
An out‐of‐core branch‐and‐bound (B&B) method to solve large 0‐1 knapsack problems on
a graphics processing unit (GPU) is proposed. Given a large problem that produces many …
a graphics processing unit (GPU) is proposed. Given a large problem that produces many …
Exploring fine-grained resource rental planning in cloud computing
Application services based on cloud computing infrastructure are proliferating over the
Internet. In this paper, we investigate the problem of how to minimize cloud resource rental …
Internet. In this paper, we investigate the problem of how to minimize cloud resource rental …
Parallel Branch-and-Bound in multi-core multi-CPU multi-GPU heterogeneous environments
TT Vu, B Derbel - Future Generation Computer Systems, 2016 - Elsevier
We investigate the design of parallel B&B in large scale heterogeneous compute
environments where processing units can be composed of a mixture of multiple shared …
environments where processing units can be composed of a mixture of multiple shared …
A parallel graph edit distance algorithm
Graph edit distance (GED) has emerged as a powerful and flexible graph matching
paradigm that can be used to address different tasks in pattern recognition, machine …
paradigm that can be used to address different tasks in pattern recognition, machine …
A GPU parallelization of branch-and-bound for multiproduct batch plants optimization
A Borisenko, M Haidl, S Gorlatch - The Journal of Supercomputing, 2017 - Springer
Abstract Branch-and-bound (B&B) is a popular approach to accelerate the solution of the
optimization problems, but its parallelization on graphics processing units (GPUs) is …
optimization problems, but its parallelization on graphics processing units (GPUs) is …
An efficient parallelization strategy for dynamic programming on gpu
KE Berger, F Galea - 2013 IEEE International Symposium on …, 2013 - ieeexplore.ieee.org
Optimization methods generally do not fall into the most suitable algorithms for
parallelization on a GPU. However, a relatively good efficiency still can be obtained if the …
parallelization on a GPU. However, a relatively good efficiency still can be obtained if the …