找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Hybrid Metaheuristics; Second International María J. Blesa,Christian Blum,Michael Sampels Conference proceedings 2005 Springer-Verlag Berli

[复制链接]
查看: 55724|回复: 51
发表于 2025-3-21 18:50:10 | 显示全部楼层 |阅读模式
书目名称Hybrid Metaheuristics
副标题Second International
编辑María J. Blesa,Christian Blum,Michael Sampels
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Hybrid Metaheuristics; Second International María J. Blesa,Christian Blum,Michael Sampels Conference proceedings 2005 Springer-Verlag Berli
出版日期Conference proceedings 2005
关键词algorithmics; algorithms; ant colony optimization; approximation algorithms; clustering; combinatorial op
版次1
doihttps://doi.org/10.1007/11546245
isbn_softcover978-3-540-28535-9
isbn_ebook978-3-540-31898-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2005
The information of publication is updating

书目名称Hybrid Metaheuristics影响因子(影响力)




书目名称Hybrid Metaheuristics影响因子(影响力)学科排名




书目名称Hybrid Metaheuristics网络公开度




书目名称Hybrid Metaheuristics网络公开度学科排名




书目名称Hybrid Metaheuristics被引频次




书目名称Hybrid Metaheuristics被引频次学科排名




书目名称Hybrid Metaheuristics年度引用




书目名称Hybrid Metaheuristics年度引用学科排名




书目名称Hybrid Metaheuristics读者反馈




书目名称Hybrid Metaheuristics读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:52:00 | 显示全部楼层
发表于 2025-3-22 00:47:26 | 显示全部楼层
发表于 2025-3-22 05:42:46 | 显示全部楼层
A Taxonomy of Cooperative Search Algorithms,llel meta-heuristics, hybrid meta-heuristic, and cooperative search algorithms. Different taxonomies have been proposed in the literature for parallel and hybrid meta-heuristics. In these taxonomies, one can realize that cooperative search algorithms lie somewhere in between. This paper looks at coo
发表于 2025-3-22 10:36:04 | 显示全部楼层
A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem,m approach with variable neighborhood descent. Our hybrid compares favorable with previous pure genetic algorithm. Computational experiences show that problems with 200 propositional letters can be solved. They are, to the best of our knowledge, the largest PSAT-problems reported in the literature.
发表于 2025-3-22 13:04:13 | 显示全部楼层
发表于 2025-3-22 20:49:03 | 显示全部楼层
发表于 2025-3-22 22:17:50 | 显示全部楼层
Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows,aints (VRPTW). Ejection chains create powerful compound moves within Local Search algorithms. Their potential to yield state of the art algorithms has been validated for the traveling salesman problem (TSP), for example. We show how ejection chains can be used to tackle the more general VRPTW as wel
发表于 2025-3-23 03:12:03 | 显示全部楼层
3D Inter-subject Medical Image Registration by Scatter Search,ent conditions. Point matching is an image registration approach based on searching for the right pairing of points between the two images. From this matching, the registration transformation we are searching, can be inferred by means of numerical methods..In this paper, we propose a scatter search
发表于 2025-3-23 09:19:08 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-8 06:02
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表