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

A genetic approach for network partitioning

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

DOI10.1080/00207169208804049zbMath0742.68004OpenAlexW2162394398MaRDI QIDQ3989752

Shu Park Chan, Lin-Ming Jin

Publication date: 28 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169208804049


zbMATH Keywords

partitioninggenetic algorithmsdiscrete optimization\(NP\)-complete problems


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Network design and communication in computer systems (68M10) Discrete mathematics in relation to computer science (68R99)


Related Items (1)

Metaheuristics: A bibliography




Cites Work

  • Unnamed Item
  • Optimization by Simulated Annealing
  • An Improved Min-Cut Algonthm for Partitioning VLSI Networks




This page was built for publication: A genetic approach for network partitioning

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