Greedy differencing edge-contraction heuristic for the max-cut problem
type: Item
instance of: scholarly article
title: Greedy differencing edge-contraction heuristic for the max-cut problem
author: Refael Hassin
author: Nikita Leshenko
published in: Operations Research Letters
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90-XX
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7443021
zbMATH Keywords: max cut
zbMATH Keywords: differencing method
zbMATH Keywords: edge contraction
MaRDI profile type: Publication
full work available at URL: j.orl.2021.02.006
OpenAlex ID: W3133894430
cites work: Network Design Using Cut Inequalities
cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
cites work: A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
cites work: What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
cites work: Estimation of Distribution Algorithm for the Max-Cut Problem
DOI: 10.1016/J.ORL.2021.02.006
description: scientific article; zbMATH DE number 7443021