New Ant Colony Optimization Algorithms for Variants of Multidimensional Assignments in d-Partite Graphs
This article presents ant algorithms for single- and multi-criteria industrial optimization problems. A common factor in these algorithms is the determination of the set with the maximum number of cliques, which represent the solution to multidimensional assignment problems in d-partite graphs. In t...
Saved in:
| Main Author: | Krzysztof Schiff |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-07-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/15/15/8251 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2
by: Jaya Santoso, et al.
Published: (2025-04-01) -
ON PROPERTIES OF PRIME IDEAL GRAPHS OF COMMUTATIVE RINGS
by: Rian Kurnia, et al.
Published: (2023-09-01) -
Multi-fidelity graph neural networks for predicting toluene/water partition coefficients
by: Thomas Nevolianis, et al.
Published: (2025-08-01) -
REDUCING GRAPHS BY LIFTING ROTATIONS OF EDGES TO SPLITTABLE GRAPHS
by: Vitaly Baransky, et al.
Published: (2024-12-01) -
Sorting misorganized books in libraries based on ant colony algorithm
by: Ling Chen
Published: (2025-12-01)