๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[Algorithms and Combinatorics] Combinatorial Optimization Volume 21 || b-Matchings and T-Joins

โœ Scribed by ,


Book ID
120412669
Publisher
Springer Berlin Heidelberg
Year
2008
Tongue
German
Weight
334 KB
Edition
4th
Category
Article
ISBN
3540718435

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 -- Facility Location. Bernhard Korte, Jens Vygen. Includes Bibliographical References And Indexes.


๐Ÿ“œ SIMILAR VOLUMES


[Algorithms and Combinatorics 21] Combin
โœ , ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer-Verlag ๐ŸŒ German โš– 184 KB

This comprehensive textbook on combinatorial optimization places 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. It