Combinatorial optimization : theory and algorithms
"This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. Thi...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin ; Heidelberg :
Springer
[20..].
Cham : Springer Nature |
| Édition: | Fifth edition 2012. |
| Collection: | Algorithms and combinatorics
21 |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Combinatorial optimization, theory and algorithms, Bernhard Korte, Jens Vygen, Fifth edition, 2012, Heidelberg, Springer, 1 vol. (XIX-659 p.), Algorithms and Combinatorics, 978-3-642-24487-2 |
Table des matières:
- 1 Introduction 2 Graphs 3 Linear Programming 4 Linear Programming Algorithms 5 Integer Programming 6 Spanning Trees and Arborescences 7 Shortest Paths 8 Network Flows 9 Minimum Cost Flows 10 Maximum Matchings 11 Weighted Matching 12 b-Matchings and T -Joins 13 Matroids 14 Generalizations of Matroids 15 NP-Completeness 16 Approximation Algorithms 17 The Knapsack Problem 18 Bin-Packing 19 Multicommodity Flows and Edge-Disjoint Paths 20 Network Design Problems 21 The Traveling Salesman Problem 22 Facility Location Indices