A gradient-based randomised heuristic for the maximum cut problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Mathematics in Operational Research Année : 2012

A gradient-based randomised heuristic for the maximum cut problem

Résumé

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 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.
Fichier non déposé

Dates et versions

hal-00702709 , version 1 (31-05-2012)

Identifiants

Citer

Walid Ben-Ameur, José Neto. A gradient-based randomised heuristic for the maximum cut problem. International Journal of Mathematics in Operational Research, 2012, 4 (3), pp.276-293. ⟨10.1504/12.46688⟩. ⟨hal-00702709⟩
67 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More