Abstract: Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the processing power of the modern PC does not depend only of the processing power of the CPU and can be increased by proper use of the GPGPU, i.e. General-Purpose Computation Using Graphics Hardware. Modern graph-ics hardware, initially developed for computer graphics generation, appeared to be flexible enough for general-purpose computations. In this paper we present the imple-mentation of two optimization algorithms based on the tabu search technique, namely for the traveling salsesman problem and the flow shop scheduling problem. Both algo-rithms are implemented in two versions and utilize, respectively, multi-core CPU, and GPU. The ex...
International audienceMultiobjective local search algorithms are efficient methods to solve complex ...
This paper presents two Tabu Search type algorithms for solving the multiprocessor scheduling proble...
We present a GPU algorithm for the nearest neighbor search, an important database problem. The searc...
Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the pro...
There are many combinatorial optimization problems such as traveling salesman problem, quadratic-ass...
In the paper we propose a new framework for the distributed tabu search algorithm designed to be exe...
The introduction of NVidia's powerful Tesla GPU hardware and Compute Unified Device Architecture (CU...
In this paper we observe the possibility to accelerate a search algorithm for multiobjective optimiz...
This paper presents a new approach for parallel tabu search based on adaptive parallelism. Adaptive ...
General purpose graphical processing units were proven to be useful for accelerating computationally...
Graphics processor units (GPUs) are many-core processors that perform better than central processing...
AbstractTabu search is a general heuristic procedure for global optimization which has been successf...
International audienceBranch-and-Bound (B&B) algorithms are time intensive tree-based exploration me...
Every new desktop or laptop come equipped with a multicore, programmable graphic processing unit (GP...
International audienceBranch-and-bound (B&B) algorithms are attractive methods for solving to optima...
International audienceMultiobjective local search algorithms are efficient methods to solve complex ...
This paper presents two Tabu Search type algorithms for solving the multiprocessor scheduling proble...
We present a GPU algorithm for the nearest neighbor search, an important database problem. The searc...
Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the pro...
There are many combinatorial optimization problems such as traveling salesman problem, quadratic-ass...
In the paper we propose a new framework for the distributed tabu search algorithm designed to be exe...
The introduction of NVidia's powerful Tesla GPU hardware and Compute Unified Device Architecture (CU...
In this paper we observe the possibility to accelerate a search algorithm for multiobjective optimiz...
This paper presents a new approach for parallel tabu search based on adaptive parallelism. Adaptive ...
General purpose graphical processing units were proven to be useful for accelerating computationally...
Graphics processor units (GPUs) are many-core processors that perform better than central processing...
AbstractTabu search is a general heuristic procedure for global optimization which has been successf...
International audienceBranch-and-Bound (B&B) algorithms are time intensive tree-based exploration me...
Every new desktop or laptop come equipped with a multicore, programmable graphic processing unit (GP...
International audienceBranch-and-bound (B&B) algorithms are attractive methods for solving to optima...
International audienceMultiobjective local search algorithms are efficient methods to solve complex ...
This paper presents two Tabu Search type algorithms for solving the multiprocessor scheduling proble...
We present a GPU algorithm for the nearest neighbor search, an important database problem. The searc...