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...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin ; Heidelberg :
Springer
[20..].
Cham : Springer Nature |
| Ausgabe: | Fifth edition 2012. |
| Schriftenreihe: | Algorithms and combinatorics
21 |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
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 |
| LEADER | 03577nam a22003377a 4500 | ||
|---|---|---|---|
| 001 | 974150 | ||
| 008 | 120309q2000 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN159085098 | ||
| 020 | |a 9783642244889 | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.6 | ||
| 100 | 1 | |a Korte, Bernhard H., |d 1938-2025. | |
| 245 | 1 | 0 | |a Combinatorial optimization : |b theory and algorithms |c Bernhard Korte, Jens Vygen. |
| 250 | |a Fifth edition 2012. | ||
| 260 | |a Berlin ; |a Heidelberg : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Algorithms and combinatorics |v 21 |x 2197-6783 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 1 | |a 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 | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a "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. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization." | ||
| 700 | 1 | |a Vygen, Jens, |d 1967- |4 aut | |
| 776 | 0 | |0 166454125 |t Combinatorial optimization |o theory and algorithms |f Bernhard Korte, Jens Vygen |e Fifth edition |d 2012 |c Heidelberg |n Springer |p 1 vol. (XIX-659 p.) |s Algorithms and Combinatorics |z 978-3-642-24487-2 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-3-642-24488-9 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-6JT6SNSH-5 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750603631 |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-3-642-24488-9 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753963868 |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-3-642-24488-9 |z Accès INSA CVL | |
| 997 | |0 974150 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||