Combinatorial optimization : theory and algorithms
"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...
Wedi'i Gadw mewn:
| Prif Awduron: | , |
|---|---|
| Fformat: | Livre numérique |
| Iaith: | Anglais |
| Cyhoeddwyd: |
Berlin ; Heidelberg :
Springer
[20..].
Cham : Springer Nature |
| Rhifyn: | Third edition. |
| Cyfres: | Algorithms and combinatorics
|
| Pynciau: | |
| Mynediad Ar-lein: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nodyn: |
Description d'après consultation du 15 mars 2011 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, Third edition, 2006, Berlin, Springer, 1 vol. (XV-597 p.), Algorithms and combinatorics, 3-540-25684-9 |
Tabl Cynhwysion:
- 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.