組合せ最適化（第２版）<br>Combinatorial Optimization : Theory and Algorithms (Algorithms and Combinatorics Vol.21) （2nd ed. 2002. XIII, 530 p. w. figs. 24 cm）

組合せ最適化（第２版）
Combinatorial Optimization : Theory and Algorithms (Algorithms and Combinatorics Vol.21) （2nd ed. 2002. XIII, 530 p. w. figs. 24 cm）

  • ただいまウェブストアではご注文を受け付けておりません。 ⇒古書を探す
  • 製本 Hardcover:ハードカバー版／ページ数 530 p.
  • 商品コード 9783540431541

基本説明

Well-written textbook at graduate level. Contains complete (but concise) proofs, also for many deep results, some of which did not appear in a book before.

Description


(Table of content)
Aus dem Inhalt:
- Preface
- Introduction
- Graphs
- Linear Programming
- Linear Programming Algorithms
- Integer Programming
- Spanning Trees and Arborescences
- Shortest Paths
- Network Flows
- Minimum cost Flows
- Maximum Matchings
- Weighted Matching
- b-Matchings and T-Joins
- Matroids
- Generalizations of Matroids
- NP-Completeness
- Approximation Algorithms
- The Knapsack Problem
- Bin Packing
- Multicommodity Flows and Edge-Disjoint Paths
- Network Design Problems
- The Traveling Salesman Problem
- Notation Index
- Author Index
- Subject Index
(Short description)
This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete (but concise) proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state-of-the-art of combinatorial optimization. For the second edition many mathematical improvements have been made in the text.