國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Dynamic programming multi-objective ...

Mankowski, Michal.

Dynamic programming multi-objective combinatorial optimization

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Dynamic programming multi-objective combinatorial optimizationby Michal Mankowski, Mikhail Moshkov.
作者:	Mankowski, Michal.
其他作者:	Moshkov, Mikhail.
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	xiv, 214 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Combinatorial optimization.
電子資源:	https://doi.org/10.1007/978-3-030-63920-4
ISBN:	9783030639204$q(electronic bk.)

Dynamic programming multi-objective combinatorial optimization
Mankowski, Michal.

Dynamic programming multi-objective combinatorial optimization[electronic resource] /by Michal Mankowski, Mikhail Moshkov. - Cham :Springer International Publishing :2021. - xiv, 214 p. :ill., digital ;24 cm. - Studies in systems, decision and control,v.3312198-4182 ;. - Studies in systems, decision and control ;v.3..

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$q(electronic bk.)

Standard No.: 10.1007/978-3-030-63920-4doiSubjects--Topical Terms:

185796
Combinatorial optimization.

LC Class. No.: QA402.5

Dewey Class. No.: 519.64

Dynamic programming multi-objective combinatorial optimization
LDR:02371nmm a2200337 a 4500 001 600535
003 DE-He213
005 20210521154512.0
006 m d
007 cr nn 008maaau
008 211104s2021 sz s 0 eng d
020 $a 9783030639204$q(electronic bk.)
020 $a 9783030639198$q(paper)
024 7 $a 10.1007/978-3-030-63920-4 $2 doi
035 $a 978-3-030-63920-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5
072 7 $a UYQ $2 bicssc
072 7 $a TEC009000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 519.64 $2 23
090 $a QA402.5 $b .M278 2021
100 1 $a Mankowski, Michal. $3 895122
245 1 0 $a Dynamic programming multi-objective combinatorial optimization $h [electronic resource] / $c by Michal Mankowski, Mikhail Moshkov.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xiv, 214 p. : $b ill., digital ; $c 24 cm.
490 1 $a Studies in systems, decision and control, $x 2198-4182 ; $v 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 Combinatorial optimization. $3 185796
650 0 $a Dynamic programming. $3 181912
650 1 4 $a Computational Intelligence. $3 338479
650 2 4 $a Programming Techniques. $3 274470
700 1 $a Moshkov, Mikhail. $3 522527
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Studies in systems, decision and control ; $v v.3. $3 678532
856 4 0 $u https://doi.org/10.1007/978-3-030-63920-4
950 $a Intelligent Technologies and Robotics (SpringerNature-42732)