An effective multilevel tabu search approach for balanced graph partitioning
type: Item
instance of: scholarly article
title: An effective multilevel tabu search approach for balanced graph partitioning
zbMATH Open document ID: 1205.90286
author: Una Benlic
author: Jin-Kao Hao
published in: Computers \& Operations Research
publication date: 2011-01-31T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5843117
zbMATH Keywords: balanced partitioning
zbMATH Keywords: multilevel approach
zbMATH Keywords: iterated tabu search
describes a project that uses: Tabu search
describes a project that uses: Chaco
describes a project that uses: Bubble-FOS/C
describes a project that uses: DibaP
describes a project that uses: METIS
MaRDI profile type: Publication
full work available at URL: j.cor.2010.10.007
OpenAlex ID: W2112882545
cites work: Recent directions in netlist partitioning: a survey
cites work: Genetic algorithm and graph partitioning
cites work: A PROBE-Based Heuristic for Graph Partitioning
cites work: Q4350061
cites work: Q4198056
cites work: Neighborhood portfolio approach for local search applied to timetabling problems
cites work: Q4354785
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Q4739657
cites work: Tabu search for graph partitioning
cites work: A combined evolutionary search and multilevel optimisation approach to graph-partitioning
cites work: Partitioning of VLSI Circuits on Subcircuits with Minimal Number of Connections Using Evolutionary Algorithm
cites work: Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
cites work: Multilevel refinement for combinatorial optimisation problems
DOI: 10.1016/J.COR.2010.10.007
description: scientific article; zbMATH DE number 5843117