Abstract
In this paper 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 nonconvex optimisation problem. Computational studies are reported. They indicate that the proposed method is competitive with the best known procedures present in the literature.
| Original language | English |
|---|---|
| Pages (from-to) | 276-293 |
| Number of pages | 18 |
| Journal | International Journal of Mathematics in Operational Research |
| Volume | 4 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Jan 2012 |
Keywords
- Combinatorial optimisation
- Maximum cut
- Randomised algorithms