An effective multilevel tabu search approach for balanced graph partitioning
Annals of Operations Research (1996)
- ISSN: 03050548
- DOI: 10.1016/j.cor.2010.10.007
Available from www.sciencedirect.com
or
Abstract
In this paper, we develop a tabu search procedure for solving the uniform graph partitioning problem. Tabu search, an abstract heuristic search method, has been shown to have promise in solving several NP-hard problems, such as job shop and flow shop scheduling, vehicle routing, quadratic assignment, and maximum satisfiability. We compare tabu search to other heuristic procedures for graph partitioning, and demonstrate that tabu search is superior to other solution approaches for the uniform graph partitioning problem both with respect to solution quality and computational requirements.
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
4 Readers on Mendeley
by Discipline
by Academic Status
25% Student (Master)
25% Post Doc
25% Ph.D. Student
by Country
25% South Korea
25% Colombia
25% Canada