A gradient-based randomised heuristic for the maximum cut problem (Q1758877)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A gradient-based randomised heuristic for the maximum cut problem |
scientific article; zbMATH DE number 6108304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A gradient-based randomised heuristic for the maximum cut problem |
scientific article; zbMATH DE number 6108304 |
Statements
A gradient-based randomised heuristic for the maximum cut problem (English)
0 references
16 November 2012
0 references
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.
0 references
combinatorial optimisation
0 references
randomised algorithms
0 references
maximum cut
0 references
0.8602466583251953
0 references
0.7799354791641235
0 references
0.7753873467445374
0 references
0.774648129940033
0 references
0.7735989093780518
0 references
