語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Dynamic Programming Multi-Objective ...
~
SpringerLink (Online service)
Dynamic Programming Multi-Objective Combinatorial Optimization
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
Dynamic Programming Multi-Objective Combinatorial Optimization/ by Michal Mankowski, Mikhail Moshkov.
作者:
Mankowski, Michal.
其他作者:
Moshkov, Mikhail.
面頁冊數:
XIV, 214 p. 67 illus.online resource. :
Contained By:
Springer Nature eBook
標題:
Computational intelligence. -
電子資源:
https://doi.org/10.1007/978-3-030-63920-4
ISBN:
9783030639204
Dynamic Programming Multi-Objective Combinatorial Optimization
Mankowski, Michal.
Dynamic Programming Multi-Objective Combinatorial Optimization
[electronic resource] /by Michal Mankowski, Mikhail Moshkov. - 1st ed. 2021. - XIV, 214 p. 67 illus.online resource. - Studies in Systems, Decision and Control,3312198-4190 ;. - Studies in Systems, Decision and Control,27.
Introduction -- Circuits Without Repetitions. Main Tools -- Combinatorial Optimization Problems. Conventional Circuits -- Multi-Stage and Bi-Criteria Optimization of Matchings in Trees -- Combinatorial Optimization Problems. Syntactical Circuits -- Index.
This book introduces a fairly universal approach to the design and analysis of exact optimization algorithms for multi-objective combinatorial optimization problems. It proposes the circuits without repetitions representing the sets of feasible solutions along with the increasing and strictly increasing cost functions as a model for such problems. The book designs the algorithms for multi-stage and bi-criteria optimization and for counting the solutions in the framework of this model. As applications, this book studies eleven known combinatorial optimization problems: matrix chain multiplication, global sequence alignment, optimal paths in directed graphs, binary search trees, convex polygon triangulation, line breaking (text justification), one-dimensional clustering, optimal bitonic tour, segmented least squares, optimization of matchings in trees, and 0/1 knapsack problem. The results presented are useful for researchers in combinatorial optimization. This book is also useful as the basis for graduate courses.
ISBN: 9783030639204
Standard No.: 10.1007/978-3-030-63920-4doiSubjects--Topical Terms:
568984
Computational intelligence.
LC Class. No.: Q342
Dewey Class. No.: 006.3
Dynamic Programming Multi-Objective Combinatorial Optimization
LDR
:02744nam a22004095i 4500
001
1052991
003
DE-He213
005
20211014213501.0
007
cr nn 008mamaa
008
220103s2021 sz | s |||| 0|eng d
020
$a
9783030639204
$9
978-3-030-63920-4
024
7
$a
10.1007/978-3-030-63920-4
$2
doi
035
$a
978-3-030-63920-4
050
4
$a
Q342
072
7
$a
UYQ
$2
bicssc
072
7
$a
TEC009000
$2
bisacsh
072
7
$a
UYQ
$2
thema
082
0 4
$a
006.3
$2
23
100
1
$a
Mankowski, Michal.
$e
author.
$4
aut
$4
http://id.loc.gov/vocabulary/relators/aut
$3
1357798
245
1 0
$a
Dynamic Programming Multi-Objective Combinatorial Optimization
$h
[electronic resource] /
$c
by Michal Mankowski, Mikhail Moshkov.
250
$a
1st ed. 2021.
264
1
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2021.
300
$a
XIV, 214 p. 67 illus.
$b
online resource.
336
$a
text
$b
txt
$2
rdacontent
337
$a
computer
$b
c
$2
rdamedia
338
$a
online resource
$b
cr
$2
rdacarrier
347
$a
text file
$b
PDF
$2
rda
490
1
$a
Studies in Systems, Decision and Control,
$x
2198-4190 ;
$v
331
505
0
$a
Introduction -- Circuits Without Repetitions. Main Tools -- Combinatorial Optimization Problems. Conventional Circuits -- Multi-Stage and Bi-Criteria Optimization of Matchings in Trees -- Combinatorial Optimization Problems. Syntactical Circuits -- Index.
520
$a
This book introduces a fairly universal approach to the design and analysis of exact optimization algorithms for multi-objective combinatorial optimization problems. It proposes the circuits without repetitions representing the sets of feasible solutions along with the increasing and strictly increasing cost functions as a model for such problems. The book designs the algorithms for multi-stage and bi-criteria optimization and for counting the solutions in the framework of this model. As applications, this book studies eleven known combinatorial optimization problems: matrix chain multiplication, global sequence alignment, optimal paths in directed graphs, binary search trees, convex polygon triangulation, line breaking (text justification), one-dimensional clustering, optimal bitonic tour, segmented least squares, optimization of matchings in trees, and 0/1 knapsack problem. The results presented are useful for researchers in combinatorial optimization. This book is also useful as the basis for graduate courses.
650
0
$a
Computational intelligence.
$3
568984
650
0
$a
Computer programming.
$3
527822
650
1 4
$a
Computational Intelligence.
$3
768837
650
2 4
$a
Programming Techniques.
$3
669781
700
1
$a
Moshkov, Mikhail.
$4
aut
$4
http://id.loc.gov/vocabulary/relators/aut
$3
786416
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer Nature eBook
776
0 8
$i
Printed edition:
$z
9783030639198
776
0 8
$i
Printed edition:
$z
9783030639211
776
0 8
$i
Printed edition:
$z
9783030639228
830
0
$a
Studies in Systems, Decision and Control,
$x
2198-4182 ;
$v
27
$3
1254124
856
4 0
$u
https://doi.org/10.1007/978-3-030-63920-4
912
$a
ZDB-2-INR
912
$a
ZDB-2-SXIT
950
$a
Intelligent Technologies and Robotics (SpringerNature-42732)
950
$a
Intelligent Technologies and Robotics (R0) (SpringerNature-43728)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入