Combinatorial Optimization

Theory and Algorithms

Bernhard Korte, Jens Vygen

530 pages, parution le 22/03/2002 (2^eme édition)

Ajouter à une liste

Indisponible

Résumé

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 several corrections and many updates have been made in the text.

Contents

Introduction
Graphs
Linear Programming
Linear Programming Algorithms
Integer Programming
Spanning Tress 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-Placking
Multicommodity Flows and Edge-Disjoint Paths
Network Design Problems
The Traveling Salesman Problem

Index

L'auteur - Bernhard Korte

Autres livres de Bernhard Korte

Optimisation combinatoire (2e éd. française)

Découvrir tous les livres de Bernhard Korte

L'auteur - Jens Vygen

Autres livres de Jens Vygen

Optimisation combinatoire (2e éd. française)

Découvrir tous les livres de Jens Vygen

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Bernhard Korte, Jens Vygen
Parution	22/03/2002
Édition	2^eme édition
Nb. de pages	530
Format	16 x 24
Couverture	Relié
Poids	916g
Intérieur	Noir et Blanc
EAN13	9783540431541