Download From Rapidshare, depositfiles, megaupload, badongo, filefactory, rapidshare, megaporn,uploadbox,uploaded, usenet without Premium!
Release counts       Today: 191       Yesterday: 273       Total: 405481
Search:
 
 
Categories:   Magazines   Books   Comics   Story   AudioBooks   Tutorials  
#    A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
Date: 17 Jan 2007, 18:55
3540256849, Pages: 597

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. This third edition contains a new chapter on facility location problems, an area which

has been extremely active in the past few years. Furthermore there are several new sections and further

material on various topics. New exercises and updates in the bibliography were added. From the reviews

of the 2nd edition: "This book on combinatorial optimization is a beautiful example of the ideal

textbook." Operations Resarch Letters 33 (2005), p.216-217 "The second edition (with corrections and

many updates) of this very recommendable book documents the relevant knowledge on combinatorial

optimization and records those problems and algorithms that define this discipline today. To read this

is very stimulating for all the researchers, practitioners, and students interested in combinatorial

optimization.

Table of Contents

1 Introduction 1
2 Graphs 13
3 Linear programming 49
4 Linear programming algorithms 65
5 Integer programming 91
6 Spanning trees and arborescences 119
7 Shortest paths 143
8 Network flows 157
9 Minimum cost flows 191
10 Maximum matchings 215
11 Weighted matching 245
12 B-matchings and T-joins 271
13 Matroids 291
14 Generalizations of matroids 323
15 NP-completeness 343
16 Approximation algorithms 377
17 The knapsack problem 415
18 Bin-packing 425
19 Multicommodity flows and edge-disjoint paths 443
20 Network design problems 467
21 The traveling salesman problem 501
22 Facility location 537


Popular posts


Достопримечательности в Калутаре. в Шри Ланке. Юго-западное побережье. полезный сайт