A gradient-based randomised heuristic for the maximum cut problem
type: Item
instance of: scholarly article
title: A gradient-based randomised heuristic for the maximum cut problem
zbMATH Open document ID: 1254.90184
DOI: 10.1504/IJMOR.2012.046688
author: Walid Ben-Ameur
author: José Neto
published in: International Journal of Mathematics in Operational Research
publication date: 2012-11-16T00:00:00Z
review text: Summary: We present a randomised heuristic for the maximum cut problem. It consists in finding an approximate solution of a formulation of the maximum cut problem as an unconstrained non-convex optimisation problem. Computational studies are reported. They indicate that the proposed method is competitive with the best known procedures present in the literature.
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6108304
zbMATH Keywords: combinatorial optimisation
zbMATH Keywords: randomised algorithms
zbMATH Keywords: maximum cut
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 6108304