An example of the Kernighan-Lin algorithm.

An example of the Kernighan-Lin algorithm.

<div><p>The objective of the max-cut problem is to cut any graph in such a way that the total weight of the edges that are cut off is maximum in both subsets of vertices that are divided due to the cut of the edges. Although it is an elementary graph partitioning problem, it is one of th...

Full description

Saved in:
Bibliographic Details
Main Author: Md. Rafiqul Islam (403453) (author)
Other Authors: Md. Shahidul Islam (9270185) (author), Pritam Khan Boni (20485200) (author), Aldrin Saurov Sarker (20485203) (author), Md. Asif Anam (20485206) (author)
Published: 2024
Subjects:
Biotechnology
Computational Biology
Biological Sciences not elsewhere classified
Mathematical Sciences not elsewhere classified
Information Systems not elsewhere classified
potentially getting trapped
mutation mechanism along
may converge slowly
challenging combinatorial optimization
application areas make
provide precise results
engineering optimization problems
problem highly admissible
obtained 533 cuts
provide proof
outcome obtained
based problems
xlink ">
total weight
tested using
superior performance
statistical significance
solved using
solution quality
set dataset
repair operator
refinement operators
quite competitive
proposed method
proposed approach
produce outcomes
potential result
parameter settings
local optima
four instances
art algorithms
adjustment operator
additional operators
acceptance criterion
9 instances
14 instances
1036 cuts
1021 cuts
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items