A modified noising algorithm for the graph partitioning problem

DOI10.1016/S0167-9260(97)00007-2zbMath0894.68064OpenAlexW1983330799WikidataQ126528073 ScholiaQ126528073MaRDI QIDQ4397095

C. Siva Ram Murthy, V. J. Sudhakar

Publication date: 30 June 1998

Published in: Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-9260(97)00007-2

zbMATH Keywords

heuristicscombinatorial optimizationsimulated annealingNP-hardgraph partitioningclique partitioningnoising method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (3)

Noising methods for a clique partitioning problem ⋮ The noising methods: A generalization of some metaheuristics ⋮ Self-tuning of the noising methods

This page was built for publication: A modified noising algorithm for the graph partitioning problem