A gradient-based randomised heuristic for the maximum cut problem

DOI10.1504/IJMOR.2012.046688zbMath1254.90184MaRDI QIDQ1758877

Walid Ben-Ameur, José Neto

Publication date: 16 November 2012

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

zbMATH Keywords

maximum cutcombinatorial optimisationrandomised algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

From Graph Orientation to the Unweighted Maximum Cut

This page was built for publication: A gradient-based randomised heuristic for the maximum cut problem