Solving the K-Cluster Optimization Problems in Combinatorial Optimization

Abood, Mouid Abd Alameer

Innovative Multidisciplinary Journal of Applied Technology · 2025-yil

Annotatsiya

The optimization problem is demonstrated to be an NP-Hardness problem in this research using a sound methodology. First off, one of the most significant NP-hardness issues in combinatorial optimization is the K-cluster problem. Second, an issue is considered difficult if it cannot be resolved specifically (i.e., in polynomial time) by a workable algorithm. Additionally, the approach taken in this paper is to use a method to demonstrate that the problem is NP-Hard. If any problem from NP can be reduced to it, as shown by means reductions, then the problem is NP-Hard.

Maqola ma’lumotlari
MualliflarAbood, Mouid Abd Alameer
JurnalInnovative Multidisciplinary Journal of Applied Technology
NashriyotТДТУ Қўқон филиали
ISSN2995-486X, 2995-486x
Nashr sanasi2025-09-04
Jild3
Son9
Betlar25-34
TilIngliz
Indeksga qo‘shilgan2026-08-26

Kalit so‘zlar

Graph clustering, K-cluster problem, semidefinite programming

Iqtibos keltirish

APAAbood, Mouid Abd Alameer (2025). Solving the K-Cluster Optimization Problems in Combinatorial Optimization. Innovative Multidisciplinary Journal of Applied Technology, 3(9), 25-34. https://www.multijournals.org/index.php/innovative/article/view/3611
GOST (OAK)Abood, Mouid Abd Alameer Solving the K-Cluster Optimization Problems in Combinatorial Optimization // Innovative Multidisciplinary Journal of Applied Technology. – 2025. – T. 3, № 9. – P. 25-34.
MLAAbood, Mouid Abd Alameer. “Solving the K-Cluster Optimization Problems in Combinatorial Optimization.” Innovative Multidisciplinary Journal of Applied Technology, 3(9), 25-34, 2025. https://www.multijournals.org/index.php/innovative/article/view/3611
ChicagoAbood, Mouid Abd Alameer. “Solving the K-Cluster Optimization Problems in Combinatorial Optimization.” Innovative Multidisciplinary Journal of Applied Technology, 3(9), 25-34 (2025). https://www.multijournals.org/index.php/innovative/article/view/3611
HarvardAbood, Mouid Abd Alameer (2025) ‘Solving the K-Cluster Optimization Problems in Combinatorial Optimization’, Innovative Multidisciplinary Journal of Applied Technology, 3(9), 25-34. https://www.multijournals.org/index.php/innovative/article/view/3611
BibTeX
@article{aboodmouidabdalameer2025,
  title = {Solving the K-Cluster Optimization Problems in Combinatorial Optimization},
  author = {Abood, Mouid Abd Alameer},
  journal = {Innovative Multidisciplinary Journal of Applied Technology},
  year = {2025},
  volume = {3},
  number = {9},
  pages = {25-34},
  url = {https://www.multijournals.org/index.php/innovative/article/view/3611}
}

Boshqa maqola uchun iqtibos tayyorlash

Innovative Multidisciplinary Journal of Applied Technology jurnalidan boshqa maqolalar

Innovative Multidisciplinary Journal of Applied Technology — barcha maqolalar · 2025-yil arxivi