Geometric Methods and Optimization Problems (Combinatorial Optimization)
by V. Boltyanski, H. Martini, and V. Soltan
Sales Rank: 2123521
List Price: $236.00 $236.00 At Amazon
Hardcover: 440 pages
Publisher: Springer; 1 edition December 31, 1998
Language: English
ISBN-10: 0792354540
ISBN-13: 978-0792354543
Product Dimensions:
9.3 x 6.3 x 1.2 inches
Shipping Weight: 1.7 pounds
Book Description
This book focuses on three disciplines of applied mathematics: control theory, location science and computational geometry. The authors show how methods and tools from convex geometry in a wider sense can help solve various problems from these disciplines. More precisely they consider mainly the tent method (as an application of a generalized separation theory of convex cones) in nonclassical variational calculus, various median problems in Euclidean and other Minkowski spaces (including a detailed discussion of the Fermat-Torricelli problem) and different types of partitionings of topologically complicated polygonal domains into a minimum number of convex pieces. Figures are used extensively throughout the book and there is also a large collection of exercises. Audience: Graduate students, teachers and researchers.
Book Info
Focuses on 3 disciplines of applied mathematics: control theory, location science & computational geometry. Shows how methods & tools from convex geometry in a wider sense can help solve various problems from these disciplines.
