一种寻找可验证k顶点临界子图的新启发式算法

IF 1.1 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Journal of Heuristics Pub Date : 2022-01-24 DOI:10.1007/s10732-021-09487-9
Alex Gliesch, M. Ritt
{"title":"一种寻找可验证k顶点临界子图的新启发式算法","authors":"Alex Gliesch, M. Ritt","doi":"10.1007/s10732-021-09487-9","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"28 1","pages":"61 - 91"},"PeriodicalIF":1.1000,"publicationDate":"2022-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new heuristic for finding verifiable k-vertex-critical subgraphs\",\"authors\":\"Alex Gliesch, M. Ritt\",\"doi\":\"10.1007/s10732-021-09487-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":54810,\"journal\":{\"name\":\"Journal of Heuristics\",\"volume\":\"28 1\",\"pages\":\"61 - 91\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2022-01-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Heuristics\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s10732-021-09487-9\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Heuristics","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10732-021-09487-9","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A new heuristic for finding verifiable k-vertex-critical subgraphs
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Heuristics
Journal of Heuristics 工程技术-计算机:理论方法
CiteScore
5.80
自引率
0.00%
发文量
19
审稿时长
6 months
期刊介绍: The Journal of Heuristics provides a forum for advancing the state-of-the-art in the theory and practical application of techniques for solving problems approximately that cannot be solved exactly. It fosters the development, understanding, and practical use of heuristic solution techniques for solving business, engineering, and societal problems. It considers the importance of theoretical, empirical, and experimental work related to the development of heuristics. The journal presents practical applications, theoretical developments, decision analysis models that consider issues of rational decision making with limited information, artificial intelligence-based heuristics applied to a wide variety of problems, learning paradigms, and computational experimentation. Officially cited as: J Heuristics Provides a forum for advancing the state-of-the-art in the theory and practical application of techniques for solving problems approximately that cannot be solved exactly. Fosters the development, understanding, and practical use of heuristic solution techniques for solving business, engineering, and societal problems. Considers the importance of theoretical, empirical, and experimental work related to the development of heuristics.
期刊最新文献
Genetic programming hyper-heuristic for evolving a maintenance policy for wind farms An integrated ILS-VND strategy for solving the knapsack problem with forfeits On the emerging potential of quantum annealing hardware for combinatorial optimization A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1