Combinatorial Optimization: Polyhedra and Efficiency: Algorithms and Combinatorics, cartea 24
Autor Alexander Schrijveren Limba Engleză Hardback – 10 dec 2002
Din seria Algorithms and Combinatorics
- 18%
Preț: 1100.89 lei -
Preț: 379.59 lei -
Preț: 383.74 lei - 15%
Preț: 626.15 lei - 15%
Preț: 644.92 lei - 18%
Preț: 945.79 lei - 15%
Preț: 636.09 lei - 18%
Preț: 765.19 lei - 18%
Preț: 931.71 lei - 18%
Preț: 934.02 lei - 18%
Preț: 879.44 lei -
Preț: 501.87 lei - 15%
Preț: 625.98 lei - 18%
Preț: 879.44 lei - 18%
Preț: 959.86 lei - 18%
Preț: 947.61 lei - 20%
Preț: 500.19 lei - 15%
Preț: 581.10 lei -
Preț: 391.47 lei - 15%
Preț: 631.14 lei - 18%
Preț: 952.72 lei -
Preț: 378.26 lei - 15%
Preț: 577.25 lei - 15%
Preț: 629.52 lei - 15%
Preț: 643.15 lei -
Preț: 373.76 lei
Preț: 912.87 lei
Preț vechi: 1201.15 lei
-24% Nou
Puncte Express: 1369
Preț estimativ în valută:
174.76€ • 181.65$ • 144.90£
174.76€ • 181.65$ • 144.90£
Carte disponibilă
Livrare economică 13-18 ianuarie 25
Livrare express 01-07 ianuarie 25 pentru 87.83 lei
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540443896
ISBN-10: 3540443894
Pagini: 1992
Ilustrații: CIV, 1879 p. In 3 volumes, not available separately.
Dimensiuni: 155 x 235 x 124 mm
Greutate: 3.45 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Combinatorics
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540443894
Pagini: 1992
Ilustrații: CIV, 1879 p. In 3 volumes, not available separately.
Dimensiuni: 155 x 235 x 124 mm
Greutate: 3.45 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Combinatorics
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
-8%Preț: 418.23 lei454.60 lei -
Statistical Methods for Business and EconomicsGert Nieuwenhuis-22%Preț: 349.90 lei450.90 lei -
Business Research MethodsBoris Blumberg-8%Preț: 413.04 lei448.96 lei -
-15%Preț: 635.95 lei748.18 lei -
Theory of Linear & Integer ProgrammingA Schrijver-9%Preț: 769.87 lei846.02 lei -
Making Negotiations Predictable: What Science Tells UsDavid De CremerPreț: 414.87 lei -
-18%Preț: 713.24 lei869.81 lei -
Managing Service Operations: Design and ImplementationWilliam J Hollins-15%Preț: 478.46 lei562.89 lei -
Introduction to Stochastic ProgrammingJohn R. Birge-15%Preț: 596.19 lei701.40 lei -
Newton-Type Methods for Optimization and Variational ProblemsAlexey F. Izmailov-18%Preț: 785.43 lei957.84 lei -
Integer ProgrammingMichele ConfortiPreț: 488.65 lei
Public țintă
ResearchCuprins
Introduction.- Paths and Flows.- Bipartite Matching and Covering.- Nonbipartite Matching and Covering.- Matroids and Submodular Functions.- Trees, Branchings, and Connectors.- Cliques, Stable Sets and Colouring.- Multiflows and Disjoint Paths.- Hypergraphs.- Survey of Problems, Questions and Conjectures.- References.- Name Index.- Subject Index.
Recenzii
From the reviews of the book version:
Schrijver's 3 volumes on combinatorial optimization reflect the current state of the art in this field, in particular from the viewpoint of polyhedral combinatorics and efficient algorithms. [...] The book offers a masterly introduction with many interesting historical remarks as well as an in-depth survey of combinatorial optimization. It is divided into eight main parts with 83 chapters. The main parts are (I) paths and flows, (II) bipartite matching and covering, (III) nonbipartite matching and covering, (IV) matroids and submodular functions, (V) trees, branchings and connectors, (VI) cliques, stable sets and colouring, (VII) multiflows and disjoint paths and, finally, (VIII) hypergraphs.[...] The reader is supposed to have a basic knowledge of graph theory and linear as well as integer programming. The author gives short and elegant proofs to all main results. [...]These three volumes contain an immense richness of results up to 2002 and will prove to be indispensible for any further research in the field of combinatorial optimization.
Rainer E. Burkard (Graz) Zentralblatt Math Database, 2003.
[..] Now comes Schrijver's book, a current and extremely comprehensive account, running 1,451 pages; by itself the bibliography would make a long book. But even as the book provides reference material to satisfy the experts, strong undergraduates will profit by dipping straight into nearly any chapter. Mathematics and computer science students should consult it, both to supplement their theoretical coursework or to find algorithms for practical projects. Summing Up: All three books: Recommended. Upper-division undergraduates through faculty.
American Library Association, 2003.
[ ] To the knowledge of this reviewer this work comes as close as one can hope to an encyclopaedic reference in this field. The three volumes span almost 1990 pages and the priceis quite low given the size of the work. The acquisition of it constitutes one of the most valuable investments for any researcher in this field.
...[ ]
Conclusions: The main qualities of this work should now be apparent: completeness and coherence, obviously confined to the goal established by the Author. There are about 1400 pages of text, where Schrijver confirms his gifts for a lucid and concise style. The more than 4000 references take another 300 pages. This work is a wonderful tool for researchers active in CO and an invaluable one for doctoral students trying to orient themselves in this area. It illustrates elegant and important results in PC which are both essential for the understanding of CO research today as well as making a convincing case for the key role of Discrete Mathematics in this field. Finally it describes most algorithms with precision constituting an invaluable reference for computer scientists interested inthe development of efficient algorithms for CO problems. Therefore, the principal role of this work is that of an essential reference for research work of mathematicians, computer scientists, operational researchers. But it is also more than that, because each topic is presented in a coherent and concise style, making this book the best "door" for entering any of the fields considered. I will not repeat myself speaking again of the excellent entertainment that the historical parts can provide. Given all this, the price of 90 euros is indeed a very reasonable one and Springer must be complimented for having made possible for each researcher to acquire this outstanding tool. Lex Schrijver also received some years back the Dantzig Prize for the impact of this work and its previous one; the citation of that prize ends with the following sentence: "Characterized by insights that are both broad and deep, and by a continual pursuit of simplification and unity, Schrivers’s work is scholarship at its best." I think the scientificcommunity must be really grateful to Lex and convey to him a choral "thank you!"
Francesco Maffioli, European Journal of Operations Research
"As the author states in the preface, it is his aim to offer ‘both an introduction to and an in-depth survey of polyhedral combinatorics and efficient algorithms’. This is not at all an easy task … . But he succeeds very well, and the result of his efforts is a voluminous treatise split into three volumes. The material is organized into eight parts … . This work certainly will be an indispensible source of reference for many years to come." (P. Schmitt, Monatshefte für Mathematik, Vol. 145 (4), 2005)
Schrijver's 3 volumes on combinatorial optimization reflect the current state of the art in this field, in particular from the viewpoint of polyhedral combinatorics and efficient algorithms. [...] The book offers a masterly introduction with many interesting historical remarks as well as an in-depth survey of combinatorial optimization. It is divided into eight main parts with 83 chapters. The main parts are (I) paths and flows, (II) bipartite matching and covering, (III) nonbipartite matching and covering, (IV) matroids and submodular functions, (V) trees, branchings and connectors, (VI) cliques, stable sets and colouring, (VII) multiflows and disjoint paths and, finally, (VIII) hypergraphs.[...] The reader is supposed to have a basic knowledge of graph theory and linear as well as integer programming. The author gives short and elegant proofs to all main results. [...]These three volumes contain an immense richness of results up to 2002 and will prove to be indispensible for any further research in the field of combinatorial optimization.
Rainer E. Burkard (Graz) Zentralblatt Math Database, 2003.
[..] Now comes Schrijver's book, a current and extremely comprehensive account, running 1,451 pages; by itself the bibliography would make a long book. But even as the book provides reference material to satisfy the experts, strong undergraduates will profit by dipping straight into nearly any chapter. Mathematics and computer science students should consult it, both to supplement their theoretical coursework or to find algorithms for practical projects. Summing Up: All three books: Recommended. Upper-division undergraduates through faculty.
American Library Association, 2003.
[ ] To the knowledge of this reviewer this work comes as close as one can hope to an encyclopaedic reference in this field. The three volumes span almost 1990 pages and the priceis quite low given the size of the work. The acquisition of it constitutes one of the most valuable investments for any researcher in this field.
...[ ]
Conclusions: The main qualities of this work should now be apparent: completeness and coherence, obviously confined to the goal established by the Author. There are about 1400 pages of text, where Schrijver confirms his gifts for a lucid and concise style. The more than 4000 references take another 300 pages. This work is a wonderful tool for researchers active in CO and an invaluable one for doctoral students trying to orient themselves in this area. It illustrates elegant and important results in PC which are both essential for the understanding of CO research today as well as making a convincing case for the key role of Discrete Mathematics in this field. Finally it describes most algorithms with precision constituting an invaluable reference for computer scientists interested inthe development of efficient algorithms for CO problems. Therefore, the principal role of this work is that of an essential reference for research work of mathematicians, computer scientists, operational researchers. But it is also more than that, because each topic is presented in a coherent and concise style, making this book the best "door" for entering any of the fields considered. I will not repeat myself speaking again of the excellent entertainment that the historical parts can provide. Given all this, the price of 90 euros is indeed a very reasonable one and Springer must be complimented for having made possible for each researcher to acquire this outstanding tool. Lex Schrijver also received some years back the Dantzig Prize for the impact of this work and its previous one; the citation of that prize ends with the following sentence: "Characterized by insights that are both broad and deep, and by a continual pursuit of simplification and unity, Schrivers’s work is scholarship at its best." I think the scientificcommunity must be really grateful to Lex and convey to him a choral "thank you!"
Francesco Maffioli, European Journal of Operations Research
"As the author states in the preface, it is his aim to offer ‘both an introduction to and an in-depth survey of polyhedral combinatorics and efficient algorithms’. This is not at all an easy task … . But he succeeds very well, and the result of his efforts is a voluminous treatise split into three volumes. The material is organized into eight parts … . This work certainly will be an indispensible source of reference for many years to come." (P. Schmitt, Monatshefte für Mathematik, Vol. 145 (4), 2005)
Notă biografică
Alexander Schrijver is one of the most respected researchers in this area. He has won the Dantzig award, the Fulkerson prize (twice) and the Lanchester Prize for his earlier classic text on "Theory of Linear and Integer Programming".
Textul de pe ultima copertă
This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.
Caracteristici
Most comprehensive work on the subject Will become a classic Includes supplementary material: sn.pub/extras