Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem

Refael Hassin; Nikita Leshenko

doi:10.1016/j.orl.2021.02.006

Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem

Refael Hassin, Nikita Leshenko

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

The Max-Cut problem is a classical NP-hard problem where the objective is to partition the nodes of an edge-weighted graph in a way that maximizes the sum of edges between the parts. We present a greedy heuristic for solving Max-Cut that combines an Edge-Contraction heuristic with the Differencing Method. We compare the heuristic's performance to other greedy heuristics using a large and diverse set of problem instances.

Original language	English
Pages (from-to)	320-325
Number of pages	6
Journal	Operations Research Letters
Volume	49
Issue number	3
DOIs	https://doi.org/10.1016/j.orl.2021.02.006
State	Published - May 2021

Keywords

Differencing method
Edge contraction
Max cut

Access to Document

10.1016/j.orl.2021.02.006

Cite this

@article{7da9af0566f34f43967e0194f19aa7d8,

title = "Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem",

abstract = "The Max-Cut problem is a classical NP-hard problem where the objective is to partition the nodes of an edge-weighted graph in a way that maximizes the sum of edges between the parts. We present a greedy heuristic for solving Max-Cut that combines an Edge-Contraction heuristic with the Differencing Method. We compare the heuristic's performance to other greedy heuristics using a large and diverse set of problem instances.",

keywords = "Differencing method, Edge contraction, Max cut",

author = "Refael Hassin and Nikita Leshenko",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",

year = "2021",

month = may,

doi = "10.1016/j.orl.2021.02.006",

language = "אנגלית",

volume = "49",

pages = "320--325",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem

AU - Hassin, Refael

AU - Leshenko, Nikita

PY - 2021/5

Y1 - 2021/5

N2 - The Max-Cut problem is a classical NP-hard problem where the objective is to partition the nodes of an edge-weighted graph in a way that maximizes the sum of edges between the parts. We present a greedy heuristic for solving Max-Cut that combines an Edge-Contraction heuristic with the Differencing Method. We compare the heuristic's performance to other greedy heuristics using a large and diverse set of problem instances.

AB - The Max-Cut problem is a classical NP-hard problem where the objective is to partition the nodes of an edge-weighted graph in a way that maximizes the sum of edges between the parts. We present a greedy heuristic for solving Max-Cut that combines an Edge-Contraction heuristic with the Differencing Method. We compare the heuristic's performance to other greedy heuristics using a large and diverse set of problem instances.

KW - Differencing method

KW - Edge contraction

KW - Max cut

UR - http://www.scopus.com/inward/record.url?scp=85102872432&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2021.02.006

DO - 10.1016/j.orl.2021.02.006

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85102872432

VL - 49

SP - 320

EP - 325

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 3

ER -

Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this