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

Improving Simulated Annealing for Clique Partitioning Problems

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

DOI10.1613/jair.1.13382OpenAlexW4288060505MaRDI QIDQ5101310

Jian Gao, Yiqi Lv, Minghao Liu, Feifei Ma, Shaowei Cai

Publication date: 30 August 2022

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.13382


zbMATH Keywords

heuristics


Mathematics Subject Classification ID

Artificial intelligence (68Txx)


Related Items (1)

Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem







This page was built for publication: Improving Simulated Annealing for Clique Partitioning Problems

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