國立虎尾科技大學 |

Introduction to Combinatorial Optimization

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Introduction to Combinatorial Optimization/ by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu.
作者:	Du, Ding-Zhu.
其他作者:	Pardalos, Panos M.
面頁冊數:	XI, 402 p. 144 illus., 132 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical optimization. -
電子資源:	https://doi.org/10.1007/978-3-031-10596-8
ISBN:	9783031105968

Introduction to Combinatorial Optimization
Du, Ding-Zhu.

Introduction to Combinatorial Optimization[electronic resource] /by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu. - 1st ed. 2022. - XI, 402 p. 144 illus., 132 illus. in color.online resource. - Springer Optimization and Its Applications,1961931-6836 ;. - Springer Optimization and Its Applications,104.

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

Standard No.: 10.1007/978-3-031-10596-8doiSubjects--Topical Terms:

527675
Mathematical optimization.

LC Class. No.: QA402.5-402.6

Dewey Class. No.: 519.6

Introduction to Combinatorial Optimization
LDR:03166nam a22004095i 4500 001 1083594
003 DE-He213
005 20220926195636.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031105968 $9 978-3-031-10596-8
024 7 $a 10.1007/978-3-031-10596-8 $2 doi
035 $a 978-3-031-10596-8
050 4 $a QA402.5-402.6
072 7 $a PBU $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a PBU $2 thema
082 0 4 $a 519.6 $2 23
100 1 $a Du, Ding-Zhu. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 670906
245 1 0 $a Introduction to Combinatorial Optimization $h [electronic resource] / $c by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XI, 402 p. 144 illus., 132 illus. in color. $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 Springer Optimization and Its Applications, $x 1931-6836 ; $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 Mathematical optimization. $3 527675
650 0 $a Computer science. $3 573171
650 0 $a Operations research. $3 573517
650 0 $a Management science. $3 719678
650 0 $a Algorithms. $3 527865
650 1 4 $a Optimization. $3 669174
650 2 4 $a Theory of Computation. $3 669322
650 2 4 $a Operations Research, Management Science . $3 1366052
700 1 $a Pardalos, Panos M. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 669384
700 1 $a Hu, Xiaodong. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 681007
700 1 $a Wu, Weili. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 678792
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031105944
776 0 8 $i Printed edition: $z 9783031105951
776 0 8 $i Printed edition: $z 9783031116841
830 0 $a Springer Optimization and Its Applications, $x 1931-6828 ; $v 104 $3 1255232
856 4 0 $u https://doi.org/10.1007/978-3-031-10596-8
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)