找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Advances in Stochastic and Deterministic Global Optimization; Panos M. Pardalos,Anatoly Zhigljavsky,Julius Žilin Book 2016 Springer Intern

[复制链接]
楼主: Hypothesis
发表于 2025-3-25 04:00:34 | 显示全部楼层
发表于 2025-3-25 10:01:33 | 显示全部楼层
https://doi.org/10.1007/978-3-663-19701-0 nonlinear bi-objective optimization problem. A heuristic algorithm is proposed which obtains a good approximation of the Pareto front when the new facilities have to be selected from a finite set of candidates.
发表于 2025-3-25 12:04:49 | 显示全部楼层
发表于 2025-3-25 16:09:04 | 显示全部楼层
Combining Interval and Probabilistic Uncertainty: What Is Computable?thms for taking uncertainty into account..Before we concentrate our efforts on designing such algorithms, it is important to make sure that such an algorithm is possible in the first place, i.e., that the corresponding problem is algorithmically computable. In this paper, we analyze the computabilit
发表于 2025-3-25 20:58:29 | 显示全部楼层
发表于 2025-3-26 02:44:09 | 显示全部楼层
发表于 2025-3-26 07:55:31 | 显示全部楼层
Understanding the Impact of Constraints: A Rank Based Fitness Function for Evolutionary Methodseparate objective. The results presented show that the fitness function provides the desired selection pressure and, when combined with the multi-objective plant propagation algorithm, is able to find good designs that achieve the desired constraint simultaneously.
发表于 2025-3-26 08:42:34 | 显示全部楼层
Advances in Stochastic and Deterministic Global Optimization
发表于 2025-3-26 16:39:30 | 显示全部楼层
Book 2016objective function, the development and implementation of efficient algorithms for global optimization with single and multiple objectives, and application of algorithms for solving real-world practical problems..
发表于 2025-3-26 17:18:14 | 显示全部楼层
Christian Liebchen,Rolf H. Möhringthms for taking uncertainty into account..Before we concentrate our efforts on designing such algorithms, it is important to make sure that such an algorithm is possible in the first place, i.e., that the corresponding problem is algorithmically computable. In this paper, we analyze the computabilit
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-15 12:12
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表