語系:
繁體中文
English
說明(常見問題)
圖資館首頁
登入
回首頁
到查詢結果
[ author_sort:"du, ding-zhu." ]
切換:
標籤
|
MARC模式
|
ISBD
Introduction to combinatorial optimization
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Introduction to combinatorial optimizationby Ding-Zhu Du ... [et al.].
其他作者:
Du, Ding-Zhu.
出版者:
Cham :Springer International Publishing :2022.
面頁冊數:
xi, 402 p. :ill., digital ;24 cm.
Contained By:
Springer Nature eBook
標題:
Combinatorial optimization.
電子資源:
https://doi.org/10.1007/978-3-031-10596-8
ISBN:
9783031105968$q(electronic bk.)
Introduction to combinatorial optimization
Introduction to combinatorial optimization
[electronic resource] /by Ding-Zhu Du ... [et al.]. - Cham :Springer International Publishing :2022. - xi, 402 p. :ill., digital ;24 cm. - Springer optimization and its applications,v. 1961931-6836 ;. - Springer optimization and its applications ;v. 3..
1. Introduction -- 2. Divide-and-Conquer -- 3. Dynamic Programming and Shortest Path -- 4. Greedy Algorithm and Spanning Tree -- 5. Incremental Method and Maximum Network Flow -- 6. Linear Programming -- 7. Primal-Dual Methods and Minimum Cost Flow -- 8. NP-hard Problems and Approximation Algorithms -- 9. Restriction and Steiner Tree -- 10. Greedy Approximation and Submodular Optimization -- 11. Relaxation and Rounding. 12. Nonsubmodular Optimization -- Bibliography.
Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, such as greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.
ISBN: 9783031105968$q(electronic bk.)
Standard No.: 10.1007/978-3-031-10596-8doiSubjects--Topical Terms:
185796
Combinatorial optimization.
LC Class. No.: QA402.5
Dewey Class. No.: 519.64
Introduction to combinatorial optimization
LDR
:02745nmm a2200337 a 4500
001
630691
003
DE-He213
005
20220926195636.0
006
m d
007
cr nn 008maaau
008
230329s2022 sz s 0 eng d
020
$a
9783031105968$q(electronic bk.)
020
$a
9783031105944$q(paper)
024
7
$a
10.1007/978-3-031-10596-8
$2
doi
035
$a
978-3-031-10596-8
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA402.5
072
7
$a
PBU
$2
bicssc
072
7
$a
MAT003000
$2
bisacsh
072
7
$a
PBU
$2
thema
082
0 4
$a
519.64
$2
23
090
$a
QA402.5
$b
.I61 2022
245
0 0
$a
Introduction to combinatorial optimization
$h
[electronic resource] /
$c
by Ding-Zhu Du ... [et al.].
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2022.
300
$a
xi, 402 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Springer optimization and its applications,
$x
1931-6836 ;
$v
v. 196
505
0
$a
1. Introduction -- 2. Divide-and-Conquer -- 3. Dynamic Programming and Shortest Path -- 4. Greedy Algorithm and Spanning Tree -- 5. Incremental Method and Maximum Network Flow -- 6. Linear Programming -- 7. Primal-Dual Methods and Minimum Cost Flow -- 8. NP-hard Problems and Approximation Algorithms -- 9. Restriction and Steiner Tree -- 10. Greedy Approximation and Submodular Optimization -- 11. Relaxation and Rounding. 12. Nonsubmodular Optimization -- Bibliography.
520
$a
Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, such as greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.
650
0
$a
Combinatorial optimization.
$3
185796
650
1 4
$a
Optimization.
$3
274084
650
2 4
$a
Theory of Computation.
$3
274475
650
2 4
$a
Operations Research, Management Science.
$3
511451
650
2 4
$a
Algorithms.
$3
184661
700
1
$a
Du, Ding-Zhu.
$3
253890
710
2
$a
SpringerLink (Online service)
$3
273601
773
0
$t
Springer Nature eBook
830
0
$a
Springer optimization and its applications ;
$v
v. 3.
$3
440366
856
4 0
$u
https://doi.org/10.1007/978-3-031-10596-8
950
$a
Mathematics and Statistics (SpringerNature-11649)
筆 0 讀者評論
全部
電子館藏
館藏
1 筆 • 頁數 1 •
1
條碼號
館藏地
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
000000219716
電子館藏
1圖書
電子書
EB QA402.5 .I61 2022 2022
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
多媒體檔案
https://doi.org/10.1007/978-3-031-10596-8
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入