Wonder Club world wonders pyramid logo
×

Geometric Algorithms and Combinatorial Optimization Book

Geometric Algorithms and Combinatorial Optimization
Be the First to Review this Item at Wonderclub
X
Geometric Algorithms and Combinatorial Optimization, This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algori, Geometric Algorithms and Combinatorial Optimization
out of 5 stars based on 0 reviews
5
0 %
4
0 %
3
0 %
2
0 %
1
0 %
Digital Copy
PDF format
1 available   for $99.99
Original Magazine
Physical Format

Sold Out

  • Geometric Algorithms and Combinatorial Optimization
  • Written by author Martin Grotschel
  • Published by Springer-Verlag New York, LLC, 12/21/2011
  • This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algori
Buy Digital  USD$99.99

WonderClub View Cart Button

WonderClub Add to Inventory Button
WonderClub Add to Wishlist Button
WonderClub Add to Collection Button

Book Categories

Authors

This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a point in a convex set and the basis reduction method for point lattices. This book is a continuation and extension of previous research of the authors for which they received the Fulkerson prize, awarded by the Mathematical Programming Society and the American Mathematical Society. The first edition of this book was received enthusiastically by the community of discrete mathematicians, combinatorial optimizers, operations researchers, and computer scientists. To quote just from a few reviews: "The book is written in a very grasping way, legible both for people who are interested in the most important results and for people who are interested in technical details and proofs." #manuscripta geodaetica#1


Login

  |  

Complaints

  |  

Blog

  |  

Games

  |  

Digital Media

  |  

Souls

  |  

Obituary

  |  

Contact Us

  |  

FAQ

CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!!

X
WonderClub Home

This item is in your Wish List

Geometric Algorithms and Combinatorial Optimization, This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algori, Geometric Algorithms and Combinatorial Optimization

X
WonderClub Home

This item is in your Collection

Geometric Algorithms and Combinatorial Optimization, This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algori, Geometric Algorithms and Combinatorial Optimization

Geometric Algorithms and Combinatorial Optimization

X
WonderClub Home

This Item is in Your Inventory

Geometric Algorithms and Combinatorial Optimization, This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algori, Geometric Algorithms and Combinatorial Optimization

Geometric Algorithms and Combinatorial Optimization

WonderClub Home

You must be logged in to review the products

E-mail address:

Password: