AbstractThe paper considers efficient computational load distribution for the exact parallel algorithm for the knapsack problem based on packing tree search. We propose an algorithm that provides for static and dynamic computational load balancing for the problem in question
Abstract—Current generation supercomputers have over one million cores awaiting highly demanding com...
We shall describe a parallel algorithm for solving the knapsack feasibility problem, also known as t...
A systolic algorithm for the dynamic programming approach to the knapsack problem is presented. The ...
AbstractThe paper considers efficient computational load distribution for the exact parallel algorit...
International audienceAn efficient parallel algorithm for the 0-1 knapsack problem is presented. The...
International audienceThe parallelization on a supercomputer of a one list dynamic programming algor...
International audienceThe 0-1 knapsack problem is considered. A parallel dynamic programming multi-m...
Keywords: In this paper, we propose a new approach to the definition of basic problems in a constru...
AbstractComputing an optimal solution to the knapsack problem is known to be NP-hard. Consequently, ...
In parallel tree search environments, it is likely that some nodes are heavily loaded while others a...
Combinatorial optimization problems (COP) are difficult to solve by nature. One of the reasons is be...
International audienceThe most popular parallelization approach of the branch and bound algorithm co...
In this paper, we study the knapsack sharing problem, a variant of the well-known NP-Hard single kna...
Using two sample applications, we demonstrate the effectiveness of our portable and reusable library...
This paper presents a parallel implementation of the Iterative-Deepening A* algorithm on a parallel ...
Abstract—Current generation supercomputers have over one million cores awaiting highly demanding com...
We shall describe a parallel algorithm for solving the knapsack feasibility problem, also known as t...
A systolic algorithm for the dynamic programming approach to the knapsack problem is presented. The ...
AbstractThe paper considers efficient computational load distribution for the exact parallel algorit...
International audienceAn efficient parallel algorithm for the 0-1 knapsack problem is presented. The...
International audienceThe parallelization on a supercomputer of a one list dynamic programming algor...
International audienceThe 0-1 knapsack problem is considered. A parallel dynamic programming multi-m...
Keywords: In this paper, we propose a new approach to the definition of basic problems in a constru...
AbstractComputing an optimal solution to the knapsack problem is known to be NP-hard. Consequently, ...
In parallel tree search environments, it is likely that some nodes are heavily loaded while others a...
Combinatorial optimization problems (COP) are difficult to solve by nature. One of the reasons is be...
International audienceThe most popular parallelization approach of the branch and bound algorithm co...
In this paper, we study the knapsack sharing problem, a variant of the well-known NP-Hard single kna...
Using two sample applications, we demonstrate the effectiveness of our portable and reusable library...
This paper presents a parallel implementation of the Iterative-Deepening A* algorithm on a parallel ...
Abstract—Current generation supercomputers have over one million cores awaiting highly demanding com...
We shall describe a parallel algorithm for solving the knapsack feasibility problem, also known as t...
A systolic algorithm for the dynamic programming approach to the knapsack problem is presented. The ...
DOI
Add to ORKG