This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. The 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. To quote from a review: "This book ... is doubtless one of the outstanding books in discrete mathematics at all." (Journal of Information Proceedings and Cybernetics).

"About this title" may belong to another edition of this title.

Store Description

We have 20 years experience selling books worldwide! Friendly customer support. Your satisfaction guaranteed!

Visit Seller's Storefront

Seller's business information

Miramar International Services LLC

Sale & Shipping Terms

Terms of Sale

www.californiabooks.com

Shipping Terms

www.californiabooks.com

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	3 to 7 business days	2 to 5 business days
First item	US$ 0.00	US$ 12.00

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment Methods

Add to Wants

Items related to Geometric Algorithms and Combinatorial Optimization

Geometric Algorithms and Combinatorial Optimization

Gr�tschel, Martin; Lovasz, Laszlo; Schrijver, Alexander

New - Soft cover

About this Item

Bibliographic Details

About this title

Synopsis