Multi-way graph partition by stochastic probe
type: Item
instance of: scholarly article
title: Multi-way graph partition by stochastic probe
zbMATH Open document ID: 0771.90095
DOI: 10.1016/0305-0548(93)90007-6
author: Lixin Tao
author: Yongchang Zhao
published in: Computers \& Operations Research
publication date: 1993-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68W35
zbMATH DE Number: 232604
zbMATH Keywords: multi-way graph partition
zbMATH Keywords: simulated annealing
zbMATH Keywords: tabu search
zbMATH Keywords: stochastic probe algorithm
MaRDI profile type: Publication
full work available at URL: 0305-0548(93)90007-6
OpenAlex ID: W2016642846
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Q3326832
cites work: Q4198056
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Efficient algorithm for graph-partitioning problem using a problem transformation method
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: Optimization by Simulated Annealing
cites work: Cooling Schedules for Optimal Annealing
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
description: scientific article