Cargando…

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 has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Korte, Bernhard (Autor), Vygen, Jens (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
Edición:4th ed. 2008.
Colección:Algorithms and Combinatorics,
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-71844-4
003 DE-He213
005 20220118093319.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 |a 9783540718444  |9 978-3-540-71844-4 
024 7 |a 10.1007/978-3-540-71844-4  |2 doi 
050 4 |a QA297.4 
072 7 |a PBD  |2 bicssc 
072 7 |a MAT008000  |2 bisacsh 
072 7 |a PBD  |2 thema 
082 0 4 |a 511.1  |2 23 
100 1 |a Korte, Bernhard.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Combinatorial Optimization  |h [electronic resource] :  |b Theory and Algorithms /  |c by Bernhard Korte, Jens Vygen. 
250 |a 4th ed. 2008. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2008. 
300 |a XVIII, 627 p. 77 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Algorithms and Combinatorics,  |x 2197-6783 
505 0 |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. 
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 has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It contains complete but concise proofs, also for many deep results, some of which did not appear in a textbook 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 fourth edition is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem. Many further additions and updates are included as well. From the reviews of the previous editions: "This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Research Letters 33 (2005), p.216-217 "The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003), p.42 "... has become a standard textbook in the field." Zentralblatt MATH 1099.90054. 
650 0 |a Discrete mathematics. 
650 0 |a Mathematical models. 
650 0 |a Mathematical optimization. 
650 0 |a Calculus of variations. 
650 0 |a Computer science-Mathematics. 
650 0 |a Operations research. 
650 1 4 |a Discrete Mathematics. 
650 2 4 |a Mathematical Modeling and Industrial Mathematics. 
650 2 4 |a Calculus of Variations and Optimization. 
650 2 4 |a Mathematics of Computing. 
650 2 4 |a Operations Research and Decision Theory. 
700 1 |a Vygen, Jens.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540837206 
776 0 8 |i Printed edition:  |z 9783642090929 
776 0 8 |i Printed edition:  |z 9783540718437 
830 0 |a Algorithms and Combinatorics,  |x 2197-6783 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-540-71844-4  |z Texto Completo 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713)