Can I read Geometric Algorithms and Combinatorial Optimization = 几何算法和组合最优化 on EtoBox?

Geometric Algorithms and Combinatorial Optimization = 几何算法和组合最优化 by Martin Grotschel; László Lovász; Alexander Schrijver is a nonfiction available to read on EtoBox.

What is Geometric Algorithms and Combinatorial Optimization = 几何算法和组合最优化 about?

Historically, there is a close connection between geometry and optImization. This is illustrated by methods like the gradient method and the simplex method, which are associated with clear geometric pictures. In combinatorial optimization, however, many of the strongest and most frequently used algorithms are based on the discrete structure of the problems: the greedy algorithm, shortest path and alternating path methods, branch-and-bound, etc. In the last several years geometric methods, in particular polyhedral combinatorics, have played a more and more profound role in combinatorial optimization as well. Our book discusses two recent geometric algorithms that have turned out to have particularly interesting consequences in combinatorial optimization, at least from a theoretical point of view. These algorithms are able to utilize the rich body of results in polyhedral combinatorics. The first of these algorithms is the ellipsoid method, developed for nonlinear programming by N. Z. Shor, D. B. Yudin, and A. S. NemirovskiI. It was a great surprise when L. G. Khachiyan showed that this method can be adapted to solve linear programs in polynomial time, thus solving an important open

Who reads Geometric Algorithms and Combinatorial Optimization = 几何算法和组合最优化?

Author

Martin Grotschel; László Lovász; Alexander Schrijver

Publisher

Springer-Verlag Berlin and Heidelberg GmbH & Co. K

Published

2012

Language

EN

ISBN

9783540136248

Category

nonfiction

Subjects

Mathematics, Stem