Andere Kunden interessierten sich auch für
![Geometry of Cuts and Metrics]( "Geometry of Cuts and Metrics")
Geometry of Cuts and Metrics125,99 €![New Trends in Intuitive Geometry]( "New Trends in Intuitive Geometry")
New Trends in Intuitive Geometry74,99 €![Perspectives on Projective Geometry]( "Perspectives on Projective Geometry")
Perspectives on Projective Geometry59,99 €![Perspectives on Projective Geometry]( "Perspectives on Projective Geometry")
Perspectives on Projective Geometry82,99 €![Bodies of Constant Width]( "Bodies of Constant Width")
Bodies of Constant Width70,99 €![Algorithms in Combinatorial Geometry]( "Algorithms in Combinatorial Geometry")
Algorithms in Combinatorial Geometry81,99 €![Geometry Through History]( "Geometry Through History")
Geometry Through History41,99 €
Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, combinatorial matrix theory, statistical physics, VLSI design etc.
This book presents a wealth of results, from different mathematical disciplines, in a unified comprehensive manner, and establishes new and old links, which cannot be found elsewhere. It provides a unique and invaluable source for researchers and graduate students.
From the Reviews:
"This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the Interdisciplinarity of these fields [...]. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. [...] The longer one works with it, the more beautiful it becomes." Optima 56, 1997.
This book presents a wealth of results, from different mathematical disciplines, in a unified comprehensive manner, and establishes new and old links, which cannot be found elsewhere. It provides a unique and invaluable source for researchers and graduate students.
From the Reviews:
"This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the Interdisciplinarity of these fields [...]. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. [...] The longer one works with it, the more beautiful it becomes." Optima 56, 1997.
From the reviews:
"This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the Interdisciplinarity of these fields as it gathers methods and results from polytope theory, geometry of numbers, probability theory, design and graph theory around two objects, cuts and metrics. [... ] The book is very nicely written [... ] The book is also very well structured. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. [... ] In my opinion, the book is a beautiful piece of work. The longer one works with it, the more beautiful it becomes." Robert Weismantel, Optima 56 (1997)
"... In short, this is a very interesting book which is nice to have." Alexander I. Barvinok, MR 1460488 (98g:52001)
"... This is a large and fascinating book. As befits a book which contains material relevant to so many areas of mathematics (and related disciplines such as statistics, physics, computing science, and economics), it is self-contained and written in a readable style. Moreover, the index, bibliography, and table of contents are all that they should be in such a work; it is easy to find as much or as little introductory material as needed." R.Dawson, Zentralblatt MATH Database 0885.52001
"This is a large and fascinating book. As befits a book which contains material relevant to so many areas of mathematics (and related disciplines such as statistics, physics, computing science, and economics), it is self-contained and written in a readable style. Moreover, the index, bibliography, and table of contents are all that they should be in such a work; it is easy to find as much or as little introductory material as needed." (R. Dawson, Zentralblatt MATH, 2001)
"This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the Interdisciplinarity of these fields as it gathers methods and results from polytope theory, geometry of numbers, probability theory, design and graph theory around two objects, cuts and metrics. [... ] The book is very nicely written [... ] The book is also very well structured. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. [... ] In my opinion, the book is a beautiful piece of work. The longer one works with it, the more beautiful it becomes." Robert Weismantel, Optima 56 (1997)
"... In short, this is a very interesting book which is nice to have." Alexander I. Barvinok, MR 1460488 (98g:52001)
"... This is a large and fascinating book. As befits a book which contains material relevant to so many areas of mathematics (and related disciplines such as statistics, physics, computing science, and economics), it is self-contained and written in a readable style. Moreover, the index, bibliography, and table of contents are all that they should be in such a work; it is easy to find as much or as little introductory material as needed." R.Dawson, Zentralblatt MATH Database 0885.52001
"This is a large and fascinating book. As befits a book which contains material relevant to so many areas of mathematics (and related disciplines such as statistics, physics, computing science, and economics), it is self-contained and written in a readable style. Moreover, the index, bibliography, and table of contents are all that they should be in such a work; it is easy to find as much or as little introductory material as needed." (R. Dawson, Zentralblatt MATH, 2001)