Multi-way graph partition by stochastic probe

DOI10.1016/0305-0548(93)90007-6zbMATH Open0771.90095OpenAlexW2016642846MaRDI QIDQ2367052FDOQ2367052

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

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

zbMATH Keywords

simulated annealingtabu searchmulti-way graph partitionstochastic probe algorithm

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

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

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)