國立虎尾科技大學 |

Combinatorial Optimization = Theory and Algorithms /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Combinatorial Optimization/ by Bernhard Korte, Jens Vygen.
Reminder of title:	Theory and Algorithms /
Author:	Korte, Bernhard.
other author:	Vygen, Jens.
Description:	XXI, 698 p. 78 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Combinatorics. -
Online resource:	https://doi.org/10.1007/978-3-662-56039-6
ISBN:	9783662560396

Combinatorial Optimization = Theory and Algorithms /
Korte, Bernhard.

Combinatorial OptimizationTheory and Algorithms /[electronic resource] :by Bernhard Korte, Jens Vygen. - 6th ed. 2018. - XXI, 698 p. 78 illus.online resource. - Algorithms and Combinatorics,210937-5511 ;. - Algorithms and Combinatorics,29.

1 Introduction -- 2 Graphs -- 3 Linear Programming -- 4 Linear Programming Algorithms -- 5 Integer Programming -- 6 Spanning Trees and Arborescences -- 7 Shortest Paths -- 8 Network Flows -- 9 Minimum Cost Flows -- 10 Maximum Matchings -- 11 Weighted Matching -- 12 b-Matchings and T -Joins -- 13 Matroids -- 14 Generalizations of Matroids -- 15 NP-Completeness -- 16 Approximation Algorithms -- 17 The Knapsack Problem -- 18 Bin-Packing -- 19 Multicommodity Flows and Edge-Disjoint Paths -- 20 Network Design Problems -- 21 The Traveling Salesman Problem -- 22 Facility Location -- Indices.

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization. From the reviews of the previous editions: “This book on combinatorial optimization is a beautiful example of the ideal textbook.” Operations Research Letters 33 (2005) “This is the 5th edition of one of the standard books in combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics (graduate level and current research). It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way. The book also provides insights into and pointers to adjacent areas that could not be covered in full length for the interested reader. “Combinatorial Optimization” can easily serve as an (almost) complete reference for current research and is state-of-the-art. […]” Zentralblatt MATH 1237.90001 .

ISBN: 9783662560396

Standard No.: 10.1007/978-3-662-56039-6doiSubjects--Topical Terms:

669353
Combinatorics.

LC Class. No.: QA164-167.2

Dewey Class. No.: 511.6

Combinatorial Optimization = Theory and Algorithms /
LDR:03877nam a22004095i 4500 001 998666
003 DE-He213
005 20200706193046.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783662560396 $9 978-3-662-56039-6
024 7 $a 10.1007/978-3-662-56039-6 $2 doi
035 $a 978-3-662-56039-6
050 4 $a QA164-167.2
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 511.6 $2 23
100 1 $a Korte, Bernhard. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 677378
245 1 0 $a Combinatorial Optimization $h [electronic resource] : $b Theory and Algorithms / $c by Bernhard Korte, Jens Vygen.
250 $a 6th ed. 2018.
264 1 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2018.
300 $a XXI, 698 p. 78 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 Algorithms and Combinatorics, $x 0937-5511 ; $v 21
505 0 $a 1 Introduction -- 2 Graphs -- 3 Linear Programming -- 4 Linear Programming Algorithms -- 5 Integer Programming -- 6 Spanning Trees and Arborescences -- 7 Shortest Paths -- 8 Network Flows -- 9 Minimum Cost Flows -- 10 Maximum Matchings -- 11 Weighted Matching -- 12 b-Matchings and T -Joins -- 13 Matroids -- 14 Generalizations of Matroids -- 15 NP-Completeness -- 16 Approximation Algorithms -- 17 The Knapsack Problem -- 18 Bin-Packing -- 19 Multicommodity Flows and Edge-Disjoint Paths -- 20 Network Design Problems -- 21 The Traveling Salesman Problem -- 22 Facility Location -- Indices.
520 $a This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization. From the reviews of the previous editions: “This book on combinatorial optimization is a beautiful example of the ideal textbook.” Operations Research Letters 33 (2005) “This is the 5th edition of one of the standard books in combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics (graduate level and current research). It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way. The book also provides insights into and pointers to adjacent areas that could not be covered in full length for the interested reader. “Combinatorial Optimization” can easily serve as an (almost) complete reference for current research and is state-of-the-art. […]” Zentralblatt MATH 1237.90001 .
650 0 $a Combinatorics. $3 669353
650 0 $a Calculus of variations. $3 527927
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Operations research. $3 573517
650 0 $a Decision making. $3 528319
650 2 4 $a Calculus of Variations and Optimal Control; Optimization. $3 593942
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Operations Research/Decision Theory. $3 669176
700 1 $a Vygen, Jens. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 677379
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783662560389
776 0 8 $i Printed edition: $z 9783662560402
776 0 8 $i Printed edition: $z 9783662585665
830 0 $a Algorithms and Combinatorics, $x 0937-5511 ; $v 29 $3 1254955
856 4 0 $u https://doi.org/10.1007/978-3-662-56039-6
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)