Metaheuristic approaches for ratio cut and normalized cut graph partitioning
- 29 April 2022
- journal article
- research article
- Published by Springer Nature in Memetic Computing
- Vol. 14 (3) , 253-285
Abstract
No abstract availableKeywords
This publication has 68 references indexed in Scilit:
- Tabu search with strategic oscillation for the maximally diverse grouping problemJournal of the Operational Research Society, 2013
- An artificial bee colony algorithm for the maximally diverse grouping problemInformation Sciences, 2013
- A VNS heuristic for escaping local extrema entrapment in normalized cut clusteringPattern Recognition, 2012
- A tutorial on spectral clusteringStatistics and Computing, 2007
- A hybrid grouping genetic algorithm for the cell formation problemComputers & Operations Research, 2007
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- New spectral methods for ratio cut partitioning and clusteringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Ratio cut partitioning for hierarchical designsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- Optimization by Simulated AnnealingScience, 1983