找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Experimental and Efficient Algorithms; Third International Celso C. Ribeiro,Simone L. Martins Conference proceedings 2004 Springer-Verlag

[复制链接]
楼主: Malicious
发表于 2025-3-23 09:45:53 | 显示全部楼层
发表于 2025-3-23 15:00:02 | 显示全部楼层
Kirsten Hattermann,Rolf Mentleinoperties that make the heuristics efficient are established. We also present a mixed integer programming formulation of the problem whose linear relaxation yields tighter lower bounds than known formulations. Computational results obtained with our algorithms are compared with those from existing constructive heuristics on several types of graphs.
发表于 2025-3-23 22:00:06 | 显示全部楼层
Raymond Y. Huang,Patrick Y. Wenobust solutions. However, the efficiency of algorithms based on Local Search, such as Tabu Search, suffers from the complexity of evaluating the objective function after each move..In this paper, we propose alternative methods of dealing with uncertainties which are suitable to be implemented within a Tabu Search framework.
发表于 2025-3-24 01:40:48 | 显示全部楼层
发表于 2025-3-24 06:02:59 | 显示全部楼层
Recent Results in Cancer Researchan have a huge negative impact on the clustering quality. In this paper, we apply a clustering method that does not require a priori knowledge. We demonstrate the effectiveness and efficiency of the method on real and synthetic data sets emulating solutions in Multimodal Optimisation problems.
发表于 2025-3-24 08:29:35 | 显示全部楼层
发表于 2025-3-24 14:05:30 | 显示全部楼层
发表于 2025-3-24 17:04:22 | 显示全部楼层
https://doi.org/10.1007/978-3-031-35295-9ruction algorithm is proposed to build feasible solutions to the problem. Two neighborhood structures and a local search procedure for solution improvement are also proposed. Computational results are presented and discussed, illustrating the effectiveness of the combined approach involving randomized construction and local search.
发表于 2025-3-24 20:40:11 | 显示全部楼层
发表于 2025-3-25 02:33:02 | 显示全部楼层
An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation,an have a huge negative impact on the clustering quality. In this paper, we apply a clustering method that does not require a priori knowledge. We demonstrate the effectiveness and efficiency of the method on real and synthetic data sets emulating solutions in Multimodal Optimisation problems.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-29 23:07
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表