Multi-way graph partition by stochastic probe

DOI10.1016/0305-0548(93)90007-6zbMath0771.90095OpenAlexW2016642846MaRDI QIDQ2367052

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

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)

Related Items (1)

Metaheuristics: A bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Efficient algorithm for graph-partitioning problem using a problem transformation method
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Cooling Schedules for Optimal Annealing
• Tabu Search—Part I
• Tabu Search—Part II
• An Efficient Heuristic Procedure for Partitioning Graphs
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

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