Cantitate/Preț
Produs
Total produse
Vezi coșul
Combinatorial Optimization: Theory and Algorithms de Bernhard Korte

Combinatorial Optimization: Theory and Algorithms: Algorithms and Combinatorics, cartea 21

Autor Bernhard Korte, Jens Vygen
en Limba Engleză Paperback – 11 noi 2010
Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. Recent topics are covered as well, and numerous references are provided.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (3) 49260 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 11 ian 2019 49260 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 11 noi 2010 52373 lei  6-8 săpt.
  Springer – 22 feb 2014 53803 lei  38-44 zile
Hardback (2) 55289 lei  38-44 zile
  Springer – 13 ian 2012 55289 lei  38-44 zile
  Springer Berlin, Heidelberg – 23 mar 2018 58783 lei  6-8 săpt.

Din seria Algorithms and Combinatorics

  • 18% Matrices and Matroids for Systems Analysis
    Preț: 107997 lei
  • 18% Graph Colouring and the Probabilistic Method
    Preț: 86281 lei
  • 15% Sparsity: Graphs, Structures, and Algorithms
    Preț: 57023 lei
  • The Simplex Method: A Probabilistic Analysis
    Preț: 37267 lei
  • New Trends in Discrete and Computational Geometry
    Preț: 37675 lei
  • 15% Discrete Images, Objects, and Functions in Zn
    Preț: 61441 lei
  • 15% Linear Optimization and Extensions
    Preț: 63281 lei
  • 18% Geometry of Cuts and Metrics
    Preț: 92786 lei
  • 15% Probabilistic Methods for Algorithmic Discrete Mathematics
    Preț: 62414 lei
  • 18% Modern Cryptography, Probabilistic Proofs and Pseudorandomness
    Preț: 75075 lei
  • 18% Geometric Discrepancy: An Illustrated Guide
    Preț: 91406 lei
  • 18% Applied Finite Group Actions
    Preț: 91633 lei
  • 18% Geometric Algorithms and Combinatorial Optimization
    Preț: 86281 lei
  • Combinatorial Optimization: Theory and Algorithms
    Preț: 49260 lei
  • 15% The Strange Logic of Random Graphs
    Preț: 61424 lei
  • 24% Combinatorial Optimization: Polyhedra and Efficiency
    Preț: 98799 lei
  • 18% Discrete and Computational Geometry: The Goodman-Pollack Festschrift
    Preț: 94166 lei
  • 18% Topics in Discrete Mathematics: Dedicated to Jarik Nešetril on the Occasion of his 60th birthday
    Preț: 92967 lei
  • 20% Boolean Function Complexity: Advances and Frontiers
    Preț: 54130 lei
  • Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications
    Preț: 38433 lei
  • 15% Systems Analysis by Graphs and Matroids: Structural Solvability and Controllability
    Preț: 61929 lei
  • 18% Combinatorics and Complexity of Partition Functions
    Preț: 75741 lei
  • Greedoids
    Preț: 37137 lei
  • 15% Greedoids
    Preț: 56644 lei
  • 15% Mathematics of Ramsey Theory
    Preț: 61772 lei
  • 15% Matroid Theory and its Applications in Electric Network Theory and in Statics
    Preț: 63108 lei
  • Irregularities of Partitions
    Preț: 36695 lei

Preț: 52373 lei

Preț vechi: 61615 lei
-15% Nou

Puncte Express: 786
Preț estimativ în valută:
9270€ • 10848$ • 8110£

Carte tipărită la comandă

Livrare economică 24 ianuarie-07 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642090929
ISBN-10: 3642090923
Pagini: 648
Ilustrații: XVIII, 627 p. 77 illus.
Dimensiuni: 155 x 235 x 34 mm
Greutate: 0.89 kg
Ediția:Softcover reprint of hardcover 4th ed. 2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Combinatorics

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Recenzii

From the reviews of the 2nd Edition:
"Provides a useful collection of the major techniques, results and references in combinatorial optimization for researchers and teachers in the field."—
MATHEMATICAL REVIEWS
"This book on combinatorial optimization is a beautiful example of the ideal textbook."
Operations Resarch 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
From the reviews of the third edition:
"In the last years Korte and J. Vygen’s ‘Combinational Optimization. Theory and Algorithms’ has become a standard textbook in the field. 5 years after the first edition … the 3rd revised edition is available. … several proofs have been streamlined, the references have been updated and new exercises have been added. That makes this volume to one of the most comprehensive and up-to-date textbooks in the field of combinatorial optimization."
Rainer E. Burkard, Zentralblatt MATH, Vol. 1099 (1), 2007
"This volume is an encyclopedic reference and textbook on theory and algorithms in combinatorial optimization. … As befits a reference book, the references are very complete and up to date. … The book has separate topic and author indexes and a very useful glossary of notation. … The book … will appeal primarily to readers who want an advanced textbook that can also serve as a concise reference. … The current volume by Korte and Vygen is a worthy successor."
Brian Borchers, MathDL, May, 2006

Textul de pe ultima copertă

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

Caracteristici

Well-written textbook on combinatorial optimization One of very few textbooks on this topic Subject area has manifold applications Includes supplementary material: sn.pub/extras

Notă biografică

Bernhard Korte is professor of operations research and director of the Research Institute for Discrete Mathematics at the University of Bonn. He founded the Arithmeum in Bonn and received numerous awards, including a honorary doctoral degree and the "Staatspreis NRW". His research interests include combinatorial optimization and chip design.
Jens Vygen is professor of discrete mathematics at the University of Bonn and principal investigator of the Hausdorff Center for Mathematics. He also co-authored the textbook “Algorithmic Mathematics” and has served as editor of several books and journals. His research interests include combinatorial optimization and algorithms for chip design.