Results 111 to 120 of about 133,596 (138)
Some of the next articles are maybe not open access.
Applied Mathematics and Computation, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2017
Estimating the theoretical complexity of a parallel algorithm can give an impression on how it will perform in practice. However, this complexity analysis is very often omitted in the works from the parallel computation field. In this paper, we theoretically analyze the time complexity of our parallel algorithm for the pickup and delivery problem with ...
Miroslaw Blocho, Jakub Nalepa
openaire +1 more source
Estimating the theoretical complexity of a parallel algorithm can give an impression on how it will perform in practice. However, this complexity analysis is very often omitted in the works from the parallel computation field. In this paper, we theoretically analyze the time complexity of our parallel algorithm for the pickup and delivery problem with ...
Miroslaw Blocho, Jakub Nalepa
openaire +1 more source
Kasu Journal of Computer Science
The knapsack problem is an optimization problem in computer science which involves determining the most valuable combination of items that can be packed into a knapsack (a container) with a limited capacity (weight or volume); the goal is to maximize the total profit of the items included in the knapsack without exceeding its capacity.
Bin Usman, Bashar Bin +4 more
openaire +1 more source
The knapsack problem is an optimization problem in computer science which involves determining the most valuable combination of items that can be packed into a knapsack (a container) with a limited capacity (weight or volume); the goal is to maximize the total profit of the items included in the knapsack without exceeding its capacity.
Bin Usman, Bashar Bin +4 more
openaire +1 more source
Dense Subgraphs: Algorithms and complexity analysis of some search and covering problems.
Avec l'expansion rapide d'Internet et le développement des réseaux sociaux, des graphes massifs comprenant des milliards de sommets et d'arêtes ont émergé. Les sous-structures denses, également appelées clusters, présentes dans ces graphes sont cruciales pour de nombreuses applications.openaire +1 more source
2025 4th International Conference on Electronics Representation and Algorithm (ICERA)
Muh. Akbar +2 more
openaire +1 more source
Muh. Akbar +2 more
openaire +1 more source
2024 5th International Conference on Communications, Information, Electronic and Energy Systems (CIEES)
Ahmet Cevahir Cinar, Kadriye Nur Erman
openaire +1 more source
Ahmet Cevahir Cinar, Kadriye Nur Erman
openaire +1 more source
A survey of genetic algorithms for solving multi depot vehicle routing problem
Applied Soft Computing Journal, 2015Vili Podgorelec
exaly

