找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Non-Convex Multi-Objective Optimization; Panos M. Pardalos,Antanas ?ilinskas,Julius ?ilinsk Book Aug 20171st edition Springer Internationa

[復制鏈接]
查看: 18822|回復: 48
樓主
發(fā)表于 2025-3-21 16:29:03 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Non-Convex Multi-Objective Optimization
編輯Panos M. Pardalos,Antanas ?ilinskas,Julius ?ilinsk
視頻videohttp://file.papertrans.cn/667/666876/666876.mp4
概述Summarizes non-convex multi-objective optimization problems and methods.Supplies comprehensive coverage, theoretical background, and examples of practical applications.Explains several directions of m
叢書名稱Springer Optimization and Its Applications
圖書封面Titlebook: Non-Convex Multi-Objective Optimization;  Panos M. Pardalos,Antanas ?ilinskas,Julius ?ilinsk Book Aug 20171st edition Springer Internationa
描述Recent results on non-convex multi-objective optimization problems and methods are presented in this book, with particular attention to expensive black-box objective functions. Multi-objective optimization methods facilitate designers, engineers, and researchers to make decisions on appropriate trade-offs between various conflicting goals. A variety of deterministic and stochastic multi-objective optimization methods are developed in this book. Beginning with basic concepts and a review of non-convex single-objective optimization problems; this book moves on to cover multi-objective branch and bound algorithms, worst-case optimal algorithms (for Lipschitz functions and bi-objective problems), statistical models based algorithms, and probabilistic branch and bound approach. Detailed descriptions of new algorithms for non-convex multi-objective optimization, their theoretical substantiation, and examples for practical applications to the cell formation problem in manufacturing engineering, the process design in chemical engineering, and business process management are included to aide researchers and graduate students in mathematics, computer science, engineering, economics, and busi
出版日期Book Aug 20171st edition
關鍵詞Branch-and-Bound approach; Lipschitz optimization; applications in engineering; non-convex multi-object
版次1
doihttps://doi.org/10.1007/978-3-319-61007-8
isbn_softcover978-3-319-86981-0
issn_series 1931-6828
copyrightSpringer International Publishing AG 2017
The information of publication is updating

書目名稱Non-Convex Multi-Objective Optimization影響因子(影響力)




書目名稱Non-Convex Multi-Objective Optimization影響因子(影響力)學科排名




書目名稱Non-Convex Multi-Objective Optimization網(wǎng)絡公開度




書目名稱Non-Convex Multi-Objective Optimization網(wǎng)絡公開度學科排名




書目名稱Non-Convex Multi-Objective Optimization被引頻次




書目名稱Non-Convex Multi-Objective Optimization被引頻次學科排名




書目名稱Non-Convex Multi-Objective Optimization年度引用




書目名稱Non-Convex Multi-Objective Optimization年度引用學科排名




書目名稱Non-Convex Multi-Objective Optimization讀者反饋




書目名稱Non-Convex Multi-Objective Optimization讀者反饋學科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 2025-3-21 20:41:04 | 只看該作者
Panos M. Pardalos,Antanas ?ilinskas,Julius ?ilinskSummarizes non-convex multi-objective optimization problems and methods.Supplies comprehensive coverage, theoretical background, and examples of practical applications.Explains several directions of m
板凳
發(fā)表于 2025-3-22 00:39:23 | 只看該作者
地板
發(fā)表于 2025-3-22 07:01:43 | 只看該作者
5#
發(fā)表于 2025-3-22 10:35:46 | 只看該作者
Springer Optimization and Its Applicationshttp://image.papertrans.cn/n/image/666876.jpg
6#
發(fā)表于 2025-3-22 14:36:03 | 只看該作者
7#
發(fā)表于 2025-3-22 19:49:46 | 只看該作者
Scalarizatione reduction of a problem of multi-objective optimization to a single-objective optimization one normally is called scalarization. To find a discrete representation of the set of Pareto optimal solutions, a sequence of single-objective optimization problems should be solved, and they should hold the
8#
發(fā)表于 2025-3-22 21:23:07 | 只看該作者
9#
發(fā)表于 2025-3-23 03:36:34 | 只看該作者
10#
發(fā)表于 2025-3-23 06:45:52 | 只看該作者
Multi-Objective Branch and Boundt and discard sets of feasible decisions which cannot contain optimal decisions. The search process can be illustrated as a search tree with the root corresponding to the search space and branches corresponding to its subsets. An iteration of the algorithm processes a node in the search tree that re
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-24 20:49
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
拜城县| 睢宁县| 东乌珠穆沁旗| 金门县| 县级市| 安丘市| 平定县| 桃园市| 汪清县| 嘉黎县| 扶沟县| 望江县| 泰州市| 杂多县| 台北县| 会东县| 黄浦区| 高陵县| 双峰县| 新安县| 湖口县| 罗城| 江陵县| 翼城县| 遵义县| 滨海县| 定西市| 濮阳市| 巴林右旗| 莫力| 宝山区| 长寿区| 高清| 淄博市| 英德市| 应用必备| 谷城县| 定安县| 民勤县| 乐都县| 石楼县|