找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Combinatorial Optimization Problems in Planning and Decision Making; Theory and Applicati Michael Z. Zgurovsky,Alexander A. Pavlov Book 201

[復(fù)制鏈接]
查看: 54433|回復(fù): 44
樓主
發(fā)表于 2025-3-21 17:15:36 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Combinatorial Optimization Problems in Planning and Decision Making
副標(biāo)題Theory and Applicati
編輯Michael Z. Zgurovsky,Alexander A. Pavlov
視頻videohttp://file.papertrans.cn/230/229963/229963.mp4
概述Introduces PSC-algorithms.Helps solving operational planning problems.Covers computer-aided production management systems
叢書名稱Studies in Systems, Decision and Control
圖書封面Titlebook: Combinatorial Optimization Problems in Planning and Decision Making; Theory and Applicati Michael Z. Zgurovsky,Alexander A. Pavlov Book 201
描述The book focuses on the next fields of computer science: combinatorial optimization, scheduling theory, decision theory, and computer-aided production management systems. It also offers a quick introduction into the theory of PSC-algorithms,?which are a new class of efficient methods for intractable problems of combinatorial optimization. A PSC-algorithm is an algorithm which includes: sufficient conditions of a feasible solution optimality for which their checking can be implemented only at the stage of a feasible solution construction, and this construction is carried out by a polynomial algorithm (the first polynomial component of the PSC-algorithm); an approximation algorithm with polynomial complexity (the second polynomial component of the PSC-algorithm); also, for NP-hard combinatorial optimization problems, an exact subalgorithm if sufficient conditions were found, fulfilment of which during the algorithm execution turns it into a polynomial complexity algorithm. Practitioners and software developers will find the book useful for implementing advanced methods of production organization in the fields of planning (including operative planning) and decision making. Scientists,
出版日期Book 2019
關(guān)鍵詞combinatorial optimization; scheduling theory; decision theory; computer-aided production management sy
版次1
doihttps://doi.org/10.1007/978-3-319-98977-8
isbn_softcover978-3-030-07552-1
isbn_ebook978-3-319-98977-8Series ISSN 2198-4182 Series E-ISSN 2198-4190
issn_series 2198-4182
copyrightSpringer Nature Switzerland AG 2019
The information of publication is updating

書目名稱Combinatorial Optimization Problems in Planning and Decision Making影響因子(影響力)




書目名稱Combinatorial Optimization Problems in Planning and Decision Making影響因子(影響力)學(xué)科排名




書目名稱Combinatorial Optimization Problems in Planning and Decision Making網(wǎng)絡(luò)公開度




書目名稱Combinatorial Optimization Problems in Planning and Decision Making網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Combinatorial Optimization Problems in Planning and Decision Making被引頻次




書目名稱Combinatorial Optimization Problems in Planning and Decision Making被引頻次學(xué)科排名




書目名稱Combinatorial Optimization Problems in Planning and Decision Making年度引用




書目名稱Combinatorial Optimization Problems in Planning and Decision Making年度引用學(xué)科排名




書目名稱Combinatorial Optimization Problems in Planning and Decision Making讀者反饋




書目名稱Combinatorial Optimization Problems in Planning and Decision Making讀者反饋學(xué)科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:43:54 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:06:08 | 只看該作者
Book 2019which during the algorithm execution turns it into a polynomial complexity algorithm. Practitioners and software developers will find the book useful for implementing advanced methods of production organization in the fields of planning (including operative planning) and decision making. Scientists,
地板
發(fā)表于 2025-3-22 07:33:01 | 只看該作者
5#
發(fā)表于 2025-3-22 10:46:40 | 只看該作者
6#
發(fā)表于 2025-3-22 16:29:35 | 只看該作者
The Total Weighted Tardiness of Tasks Minimization on a Single Machineown examples of the problem. We present an approximation algorithm (the second polynomial component) based on the exact algorithm. Average statistical estimate of deviation of an approximate solution from the optimum does not exceed 5% of it.
7#
發(fā)表于 2025-3-22 17:57:50 | 只看該作者
8#
發(fā)表于 2025-3-22 21:41:15 | 只看該作者
9#
發(fā)表于 2025-3-23 01:26:41 | 只看該作者
10#
發(fā)表于 2025-3-23 06:10:38 | 只看該作者
The Four-Level Model of Planning and Decision Makingear during planning. In the Decision Making Unit we use our modified Analytic Hierarchy Process which is based on the research of empirical pairwise comparisons matrices with the help of combinatorial optimization models with weighted components of the additive functional.
 關(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ī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-19 06:46
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
梅河口市| 乌什县| 博乐市| 罗源县| 博兴县| 安化县| 易门县| 晋江市| 安仁县| 建阳市| 平和县| 行唐县| 当雄县| 宜丰县| 广宁县| 密云县| 乌审旗| 讷河市| 秦皇岛市| 临朐县| 高州市| 阿拉善右旗| 兴仁县| 循化| 启东市| 奉贤区| 林西县| 乌拉特后旗| 诸暨市| 朝阳市| 托里县| 萨嘎县| 仁寿县| 恩施市| 宿迁市| 色达县| 和林格尔县| 怀安县| 韩城市| 霍山县| 株洲市|