2022
DOI: 10.1016/j.ins.2022.07.106
|View full text |Cite
|
Sign up to set email alerts
|

Two efficient local search algorithms for the vertex bisection minimization problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 32 publications
0
1
0
Order By: Relevance
“…The graph max‐cut problem is a well‐known nonpolynomial hard problem that can be solved through combinatorial optimization. [ 65 , 66 , 67 ] The max‐cut problem is generally used for optimizing complex circuit designs, and its aim is to identify a line that cuts the largest number of edges linking two different nodes in a graph composed of several nodes. The Hopfield neural network (HNN), [ 11 , 68 ] a recurrent neural network consisting of neurons (detailed information in Note S1 , Supporting Information), was developed using a 6 × 6 array of synapses to solve the max‐cut problem composed of six nodes.…”
Section: Resultsmentioning
confidence: 99%
“…The graph max‐cut problem is a well‐known nonpolynomial hard problem that can be solved through combinatorial optimization. [ 65 , 66 , 67 ] The max‐cut problem is generally used for optimizing complex circuit designs, and its aim is to identify a line that cuts the largest number of edges linking two different nodes in a graph composed of several nodes. The Hopfield neural network (HNN), [ 11 , 68 ] a recurrent neural network consisting of neurons (detailed information in Note S1 , Supporting Information), was developed using a 6 × 6 array of synapses to solve the max‐cut problem composed of six nodes.…”
Section: Resultsmentioning
confidence: 99%