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
-
Polyhedral Graphs of GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH Problems
by: A. I. Antonov, et al.
Published: (2015-03-01) -
Application of the Modified Method of ant Colonies to Search for Rational Assignment of Employees to Tasks Using Fuzzy Sets
by: V. A. Sudakov, et al.
Published: (2020-06-01) -
Study on multidimensional fuzzy graphs through modified partial ordering
by: Jomal Josen, et al.
Published: (2024-12-01) -
Broadcasting in Stars of Cliques and Path-Connected Cliques
by: Akash Ambashankar, et al.
Published: (2025-02-01) -
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)