Combinatorial Optimization: Theory and Algorithms: Algorithms and Combinatorics, cartea 21
Autor Bernhard Korte, Jens Vygenen Limba Engleză Paperback – 22 feb 2014
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.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (3) | 497.19 lei 38-45 zile | |
| Springer – 22 feb 2014 | 497.19 lei 38-45 zile | |
| Springer Berlin, Heidelberg – 11 ian 2019 | 512.18 lei 6-8 săpt. | |
| Springer Berlin, Heidelberg – 11 noi 2010 | 544.67 lei 6-8 săpt. | |
| Hardback (2) | 510.91 lei 38-45 zile | |
| Springer – 13 ian 2012 | 510.91 lei 38-45 zile | |
| Springer Berlin, Heidelberg – 23 mar 2018 | 611.40 lei 6-8 săpt. |
Din seria Algorithms and Combinatorics
- 18%
Preț: 1123.67 lei -
Preț: 387.38 lei -
Preț: 391.61 lei - 15%
Preț: 639.08 lei - 15%
Preț: 658.22 lei - 18%
Preț: 965.34 lei - 15%
Preț: 649.22 lei - 18%
Preț: 781.00 lei - 18%
Preț: 950.96 lei - 18%
Preț: 953.35 lei - 18%
Preț: 897.65 lei -
Preț: 512.18 lei - 15%
Preț: 638.89 lei - 18%
Preț: 897.65 lei - 24%
Preț: 912.87 lei - 18%
Preț: 979.70 lei - 18%
Preț: 967.22 lei - 20%
Preț: 500.19 lei - 15%
Preț: 593.08 lei -
Preț: 399.50 lei - 15%
Preț: 644.18 lei - 18%
Preț: 972.42 lei -
Preț: 386.00 lei - 15%
Preț: 589.14 lei - 15%
Preț: 642.51 lei - 15%
Preț: 656.43 lei -
Preț: 381.43 lei
Preț: 497.19 lei
Nou
Puncte Express: 746
Preț estimativ în valută:
95.14€ • 99.46$ • 80.40£
95.14€ • 99.46$ • 80.40£
Carte tipărită la comandă
Livrare economică 03-10 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642427671
ISBN-10: 3642427677
Pagini: 680
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.93 kg
Ediția:5th ed. 2012
Editura: Springer
Colecția Springer
Seria Algorithms and Combinatorics
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642427677
Pagini: 680
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.93 kg
Ediția:5th ed. 2012
Editura: Springer
Colecția Springer
Seria Algorithms and Combinatorics
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
Lattice Methods for Multiple IntegrationI. H. Sloan-34%Preț: 642.75 lei973.11 lei -
-14%Preț: 515.24 lei599.11 lei -
Distributions: Theory and ApplicationsJ.J. Duistermaat-15%Preț: 598.50 lei704.12 lei -
Optimization with PDE ConstraintsMichael Hinze-18%Preț: 897.65 lei1094.69 lei -
Convex Analysis and Nonlinear Optimization: Theory and ExamplesJonathan Borwein-15%Preț: 443.91 lei522.25 lei -
Mathematical Control Theory: Deterministic Finite Dimensional SystemsEduardo D. Sontag-15%Preț: 511.70 lei602.00 lei -
Foundations of OptimizationOsman GülerPreț: 442.11 lei -
Geometric Optimal Control: Theory, Methods and ExamplesHeinz Schättler-15%Preț: 601.77 lei707.96 lei -
Optimal InvestmentL. C. G. Rogers-15%Preț: 464.66 lei546.65 lei -
Preț: 413.15 lei
Public țintă
GraduateCuprins
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.
Recenzii
From
the
reviews
of
the
fifth
edition:
“The book would be most suitable as a graduate text for a mathematics or computer science course. It offers a good number of exercises … . This book excels at providing very up-to-date results that give an idea of the state of the art, but also makes it clear that this is still a very active area of research. Overall, it is a comprehensive and interesting text that manages to present both the most classical and the most recent ideas in the field.” (Angele M. Hamel, ACM Computing Reviews, August, 2012)
“This is the 5th edition of one of the standard books in combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics (graduate level and current research). It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way. … ‘Combinatorial Optimization’ can easily serve as … complete reference for current research and is state-of-the-art. In this new edition references have been updated and new exercises were added.” (Sebastian Pokutta, Zentralblatt MATH, Vol. 1237, 2012)
“The book would be most suitable as a graduate text for a mathematics or computer science course. It offers a good number of exercises … . This book excels at providing very up-to-date results that give an idea of the state of the art, but also makes it clear that this is still a very active area of research. Overall, it is a comprehensive and interesting text that manages to present both the most classical and the most recent ideas in the field.” (Angele M. Hamel, ACM Computing Reviews, August, 2012)
“This is the 5th edition of one of the standard books in combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics (graduate level and current research). It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way. … ‘Combinatorial Optimization’ can easily serve as … complete reference for current research and is state-of-the-art. In this new edition references have been updated and new exercises were added.” (Sebastian Pokutta, Zentralblatt MATH, Vol. 1237, 2012)
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
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.
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)
"..... 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)
"... has become a standard textbook in the field."
Zentralblatt MATH 1099.90054
"...gives an excellent comprehensive view of the exciting field of combinatorial optimization."
Zentralblatt MATH 1149.90126
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.
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)
"..... 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)
"... has become a standard textbook in the field."
Zentralblatt MATH 1099.90054
"...gives an excellent comprehensive view of the exciting field of combinatorial optimization."
Zentralblatt MATH 1149.90126
Caracteristici
Well-written,
popular textbook
on
combinatorial
optimization
One of very few textbooks on this topic
Subject area has manifold applications
Offers complete but concise proofs, making it an invaluable practical tool for students
Updated fifth edition
One of very few textbooks on this topic
Subject area has manifold applications
Offers complete but concise proofs, making it an invaluable practical tool for students
Updated fifth edition
Descriere
This
comprehensive
textbook
on
combinatorial
optimization
emphasizes
theoretical
results
and
algorithms
with
provably
good performance,
in
contrast
to
heuristics.
The
text
contains
complete
but
concise
proofs,
and
also
provides
numerous exercises
and
references.
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.
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.