A modified noising algorithm for the graph partitioning problem

DOI10.1016/S0167-9260(97)00007-2MaRDI QIDQ4397095zbMATH OpenOpenAlexWikidataFDO

Authors V. J. Sudhakar, C. Siva Ram Murthy

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

clique partitioningcombinatorial optimizationgraph partitioningheuristicsnoising methodNP-hardsimulated annealing

Mathematics Subject Classification ID

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

Recommendations

• The noising method: A new method for combinatorial optimization
• Noising methods for a clique partitioning problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation
• The noising methods: A survey

Cited in

(4)

• The noising method: A new method for combinatorial optimization
• Noising methods for a clique partitioning problem
• Self-tuning of the noising methods
• The noising methods: A generalization of some metaheuristics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4397095)