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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Two strategies of adaptive cluster covering with descent and their comparison to other algorithms

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

DOI10.1023/A:1008334632441zbMath0922.90129OpenAlexW1608030021MaRDI QIDQ1284411

Dimitri Solomatine

Publication date: 19 October 1999

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008334632441


zbMATH Keywords

global optimizationclusteringrandomized searchadaptive cluster covering


Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20) Nonlinear programming (90C30)


Related Items (3)

A changing range genetic algorithm ⋮ Computational intelligence in earth sciences and environmental applications: issues and challenges. ⋮ Modular learning models in forecasting natural phenomena.


Uses Software

  • Genocop
  • BRENT
  • Unnamed Item






This page was built for publication: Two strategies of adaptive cluster covering with descent and their comparison to other algorithms

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