2021
DOI: 10.1088/1742-6596/1818/1/012137
|View full text |Cite
|
Sign up to set email alerts
|

Mathematical Programming Computational for Solving NP-Hardness Problem

Abstract: In this paper we will introduce a new approach for solving K-cluster problem which is one of the NP-hardness problem, in combinatorial optimization problems. In addition, P is NP-hardness if and only if the polynomial time of each NP problem is reduced to P. Actually, our study was focused on the two methods which is Penalty and Augmented Lagrangian methods base on the numerical result. Moreover, we tested the K-cluster problem and found the Augmented Lagrangian Method faster than Penalty method. Finally, our … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…Individual case studies contain design characteristics a few examples are limiting the ramp rate, generating electricity, and using energy storage. [9,10,12,16] The variables utilized in the benchmark tasks are detailed in the following sections. An objective function, (d) stands for demand, (g) stands for generation, (r) stands for ramp rate and storage inventory, (e) stands for product i's storage capacity.…”
Section: Introductionmentioning
confidence: 99%
“…Individual case studies contain design characteristics a few examples are limiting the ramp rate, generating electricity, and using energy storage. [9,10,12,16] The variables utilized in the benchmark tasks are detailed in the following sections. An objective function, (d) stands for demand, (g) stands for generation, (r) stands for ramp rate and storage inventory, (e) stands for product i's storage capacity.…”
Section: Introductionmentioning
confidence: 99%