A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM
DOI10.1142/S1469026809002710zbMATH Open1185.68500OpenAlexW2053513490MaRDI QIDQ3401072FDOQ3401072
Authors: Rong-Long Wang, Kozo Okazaki 
Publication date: 28 January 2010
Published in: International Journal of Computational Intelligence and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1469026809002710
Recommendations
- Ant colony optimization and the minimum spanning tree problem
- Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem
- An ant colony optimization algorithm for the minimum weight vertex cover problem
- An ant colony algorithm for graph coloring and labeling problems
- An ant algorithm for the partition graph coloring problem
- An ant colony algorithm for solving discrete minimum constraint removal problem
ant colony optimizationgenetic algorithmcombinatorial optimization problemsminimum graph bisection problem
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)
Cites Work
- Ant colonies for the quadratic assignment problem
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- An Efficient Heuristic Procedure for Partitioning Graphs
- Some simplified NP-complete graph problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Multiple-way network partitioning
- First steps to the runtime complexity analysis of ant colony optimization
- Model-based search for combinatorial optimization: A critical survey
- A hybrid genetic algorithm for the three-index assignment problem
- Hill Climbing with Multiple Local Optima
- Adaptive design optimization of wireless sensor networks using genetic algorithms
- Spectral methods for graph bisection problems.
This page was built for publication: A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401072)
