東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Combinatorial optimization = theory ...

Korte, Bernhard.

Linked to FindBook

Google Book

Amazon

博客來

Combinatorial optimization = theory and algorithms /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Combinatorial optimization/ by Bernhard Korte, Jens Vygen.
Reminder of title:	theory and algorithms /
Author:	Korte, Bernhard.
other author:	Vygen, Jens.
Published:	Berlin, Heidelberg :Springer Berlin Heidelberg : : 2018.,
Description:	xxi, 698 p. :ill., digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer eBooks
Subject:	Combinatorial optimization. -
Online resource:	http://dx.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. - Berlin, Heidelberg :Springer Berlin Heidelberg :2018. - xxi, 698 p. :ill., digital ;24 cm. - Algorithms and combinatorics,v.210937-5511 ;. - Algorithms and combinatorics ;v.21..

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.

ISBN: 9783662560396

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

544215
Combinatorial optimization.

LC Class. No.: QA402.5 / .K678 2018

Dewey Class. No.: 519.64

Combinatorial optimization = theory and algorithms /
LDR:01632nmm a2200325 a 4500 001 2137077
003 DE-He213
005 20181011150804.0
006 m d
007 cr nn 008maaau
008 181117s2018 gw s 0 eng d
020 $a 9783662560396 $q (electronic bk.)
020 $a 9783662560389 $q (paper)
024 7 $a 10.1007/978-3-662-56039-6 $2 doi
035 $a 978-3-662-56039-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5 $b .K678 2018
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
082 0 4 $a 519.64 $2 23
090 $a QA402.5 $b .K85 2018
100 1 $a Korte, Bernhard. $3 899093
245 1 0 $a Combinatorial optimization $h [electronic resource] : $b theory and algorithms / $c by Bernhard Korte, Jens Vygen.
250 $a 6th ed.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2018.
300 $a xxi, 698 p. : $b ill., digital ; $c 24 cm.
490 1 $a Algorithms and combinatorics, $x 0937-5511 ; $v 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.
650 0 $a Combinatorial optimization. $3 544215
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Combinatorics. $3 895617
650 2 4 $a Calculus of Variations and Optimal Control; Optimization. $3 898674
650 2 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Operations Research/Decision Theory. $3 890895
700 1 $a Vygen, Jens. $3 724479
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Algorithms and combinatorics ; $v v.21. $3 3309107
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-56039-6
950 $a Mathematics and Statistics (Springer-11649)