Clustering using GRASP and path relinking for the max k-cut problem
- 23 April 2025
- journal article
- research article
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 39 (4) , 1-38
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- A multiple search operator heuristic for the max-k-cut problemAnnals of Operations Research, 2016
- Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method2013
- A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problemAnnals of Operations Research, 2008
- Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts2006
- Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch‐and‐Cut2004
- Improved approximation algorithms for MAXk-CUT and MAX BISECTIONAlgorithmica, 1997
- Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges1997
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- Individual Comparisons by Ranking Methods1992
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955