找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 18827|回復(fù): 48
樓主
發(fā)表于 2025-3-21 16:29:03 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




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




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




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




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




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




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




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




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




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-24 23:00
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
张家港市| 甘德县| 安国市| 田阳县| 雷波县| 伊川县| 南昌市| 偃师市| 隆化县| 大邑县| 平江县| 班玛县| 阿勒泰市| 思茅市| 隆回县| 伽师县| 天长市| 普定县| 娱乐| 慈溪市| 安福县| 乐昌市| 临潭县| 巴林右旗| 分宜县| 神农架林区| 方正县| 玉山县| 本溪市| 石棉县| 渭南市| 武功县| 连州市| 安陆市| 安化县| 桂阳县| 霍山县| 高邮市| 昌乐县| 新余市| 河北区|