Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Improved genetic algorithm for maximum clique problem

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

DOI10.3724/SP.J.1087.2008.03072zbMATH Open1171.90513MaRDI QIDQ3399485FDOQ3399485

Liang Ma, Donghui Wu

Publication date: 12 October 2009

Published in: Journal of Computer Applications (Search for Journal in Brave)




zbMATH Keywords

optimizationgenetic algorithmMax Clique Problem (MCP)


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Nonnumerical algorithms (68W05)



Cited In (3)

  • A biased random-key genetic algorithm for the maximum quasi-clique problem
  • Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
  • Title not available (Why is that?)






This page was built for publication: Improved genetic algorithm for maximum clique problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399485)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3399485&oldid=16683737"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 17:18. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki