Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Research on convergence of ACO subset algorithms

From MaRDI portal
Publication:2970613
Jump to:navigation, search

DOI10.1108/03321641311297089zbMath1358.90157OpenAlexW2090848475MaRDI QIDQ2970613

Ru Zeng, Wenyu Chen, Wangyang Bian

Publication date: 30 March 2017

Published in: COMPEL - The international journal for computation and mathematics in electrical and electronic engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/03321641311297089


zbMATH Keywords

probabilistic analysisant colony optimizationalgorithm frameworknature of convergenceprogramming and algorithm theoryconvergence in solutionconvergence in value


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)


Related Items (1)

Research on convergence of ACO subset algorithms




Cites Work

  • Ant colony optimization theory: a survey
  • Research on convergence of ACO subset algorithms
  • Unnamed Item




This page was built for publication: Research on convergence of ACO subset algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2970613&oldid=15970187"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki