Яшил иқтисодиёт ва тараққиёт 3-tom 9-san (2025) · 25-34-betler

Solving the K-Cluster Optimization Problems in Combinatorial Optimization

Yaxshiyeva, Mavluda

Derekkózde oqıw PDF

Annotaciya

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.

Graph clusteringK-cluster problemsemidefinite programming

Metadata derekkózi: jurnal OAI-PMH arxivi · Sindex tolıq mátindi saqlamaydı, derekkózge silteme beredi.

Dáyeksóz alıw

APA 7 
Yaxshiyeva, Mavluda (2025). Solving the K-Cluster Optimization Problems in Combinatorial Optimization. Яшил иқтисодиёт ва тараққиёт, 3(9), 25-34.
GOST R 7.0.5 
Yaxshiyeva, Mavluda Solving the K-Cluster Optimization Problems in Combinatorial Optimization // Яшил иқтисодиёт ва тараққиёт. 2025. Т. 3. № 9. С. 25-34.
BibTeX 
@article{mavluda2025,
  author  = {Yaxshiyeva, Mavluda},
  title   = {Solving the K-Cluster Optimization Problems in Combinatorial Optimization},
  journal = {Яшил иқтисодиёт ва тараққиёт},
  year    = {2025},
  volume  = {3},
  number  = {9},
  pages   = {25-34}
}
RIS 
TY  - JOUR
AU  - Yaxshiyeva, Mavluda
TI  - Solving the K-Cluster Optimization Problems in Combinatorial Optimization
JO  - Яшил иқтисодиёт ва тараққиёт
PY  - 2025
VL  - 3
IS  - 9
SP  - 25
EP  - 34
ER  -