2021
DOI: 10.1504/ijbic.2021.119198
|View full text |Cite
|
Sign up to set email alerts
|

Jumping particle swarm optimisation method for solving minimum weight vertex cover problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…The intelligent algorithm of heuristic thought usually refers to the algorithm that people construct according to natural phenomenon, social experience, or biological inspiration, and then by summarizing simulation innovation. The idea is that when addressing multi-constraint problems, a feasible solution can be given to satisfy multiple objective optimizations [50] as far as possible. The focus is on multi-objective optimization [51][52][53], for each instance, the solution obtained now is not the optimal solution for a single objective, but the best solution under the condition of satisfying the requirements of multiple objectives as far as possible.…”
Section: Scheduling Algorithmmentioning
confidence: 99%
“…The intelligent algorithm of heuristic thought usually refers to the algorithm that people construct according to natural phenomenon, social experience, or biological inspiration, and then by summarizing simulation innovation. The idea is that when addressing multi-constraint problems, a feasible solution can be given to satisfy multiple objective optimizations [50] as far as possible. The focus is on multi-objective optimization [51][52][53], for each instance, the solution obtained now is not the optimal solution for a single objective, but the best solution under the condition of satisfying the requirements of multiple objectives as far as possible.…”
Section: Scheduling Algorithmmentioning
confidence: 99%