Multi-way graph partition by stochastic probe

DOI10.1016/0305-0548(93)90007-6MaRDI QIDQ2367052zbMATH OpenOpenAlexFDO

Authors Lixin Tao, Yongchang Zhao

Publication date 16 August 1993

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(93)90007-6

zbMATH Keywords

multi-way graph partitionsimulated annealingstochastic probe algorithmtabu search

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Programming involving graphs or networks (90C35)

Recommendations

• An effective multilevel tabu search approach for balanced graph partitioning
• scientific article; zbMATH DE number 3855167
• Two-stage m-way graph partitioning
• scientific article; zbMATH DE number 910878

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An Efficient Heuristic Procedure for Partitioning Graphs
• Cooling Schedules for Optimal Annealing
• Efficient algorithm for graph-partitioning problem using a problem transformation method
• scientific article; zbMATH DE number 3858396 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Optimization by simulated annealing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Tabu Search—Part I
• Tabu Search—Part II
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

Cited in

(4)

• Two-stage m-way graph partitioning
• Metaheuristics: A bibliography
• Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
• Simple probabilistic analysis to generalize bottleneck graph multi-partitioning

This page was built for publication: Multi-way graph partition by stochastic probe

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