Combinatorial Optimisation - Theory And Algorithms - Korte Bernhard
- Collection: Algorithms And Combinatorics
- Format: Relié Voir le descriptif
Vous en avez un à vendre ?
Vendez-le-vôtreSoyez informé(e) par e-mail dès l'arrivée de cet article
Créer une alerte prix
- Payez directement sur Rakuten (CB, PayPal, 4xCB...)
- Récupérez le produit directement chez le vendeur
- Rakuten vous rembourse en cas de problème
Gratuit et sans engagement
Félicitations !
Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !
TROUVER UN MAGASIN
Retour
Avis sur Combinatorial Optimisation - Theory And Algorithms de Korte Bernhard Format Relié - Livre Mathématiques
0 avis sur Combinatorial Optimisation - Theory And Algorithms de Korte Bernhard Format Relié - Livre Mathématiques
Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.
Présentation Combinatorial Optimisation - Theory And Algorithms de Korte Bernhard Format Relié
- Livre Mathématiques
Résumé :
This comprehensive textbook on combinatorial optimisation 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 optimisation 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 optimisation.
Sommaire:
["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","Generalisations of Matroids","NP-Completeness","Approximation Algorithms","The Knapsack Problem","Bin-Packing","Multicommodity Flows and Edge-Disjoint Paths","Network Design Problems","The Travelling Salesman Problem"]
©