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 algorithms: the ellipsoid method for finding a poin...

Full description

Bibliographic Details

Main Author:	Grötschel, Martin
Corporate Author:	SpringerLink (Online service)
Other Authors:	Lovász, L., 1948-, Schrijver, A.
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 1993.
Edition:	Second corrected edition.
Series:	Algorithms and combinatorics ; 2.
Subjects:	Mathematics. System theory. Combinatorial analysis. Mathematical optimization. Economics. Electronic books.
Online Access:	Connect to the full text of this electronic book