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...

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Päätekijät: Korte, Bernhard H., 1938-2025, Vygen, Jens, 1967- (Tekijä)
Aineistotyyppi: Livre numérique
Kieli:Anglais
Julkaistu: Berlin ; Heidelberg : Springer [20..].
Cham : Springer Nature
Painos:Third edition.
Sarja:Algorithms and combinatorics
Aiheet:
Linkit:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Huomautus: 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
LEADER 03728nam a22004337a 4500
001 938300
008 080410q2000 xxe ||| |||| 00| 0 eng d
009 PPN123124522
020 |a 9783540292975 
041 0 |a eng 
082 |a 511.6 
084 |a 90C27. 2000 
084 |a 68R10. 2000 
084 |a 05C85. 2000 
084 |a 68Q25. 2000 
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 Third edition. 
260 |a Berlin ;  |a Heidelberg :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Algorithms and combinatorics  |x 2197-6783 
500 |a Description d'après consultation du 15 mars 2011 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
504 |a Notes bibliogr. en fin de chapitres. Index 
505 1 |a 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. 
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 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. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added." 
650 |a Optimisation combinatoire 
650 |a Algorithmes 
700 1 |a Vygen, Jens,  |d 1967-  |4 aut 
776 0 |0 093325177  |t Combinatorial optimization  |o theory and algorithms  |f Bernhard Korte, Jens Vygen  |e Third edition  |d 2006  |c Berlin  |n Springer  |p 1 vol. (XV-597 p.)  |s Algorithms and combinatorics  |z 3-540-25684-9 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-29297-7  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-0965CXRH-8  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747900884  |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/3-540-29297-7  |z Accès Université d'Orléans 
856 4 |5 180339901:750913924  |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/3-540-29297-7  |z Accès INSA CVL 
997 |0 938300  |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/