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

Refael Hassin, Nikita Leshenko

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)320-325
Number of pages6
JournalOperations Research Letters
Issue number3
StatePublished - May 2021


  • Differencing method
  • Edge contraction
  • Max cut


Dive into the research topics of 'Greedy Differencing Edge-Contraction heuristic for the Max-Cut problem'. Together they form a unique fingerprint.

Cite this