Grötschel, Martin; Lovász, László; Schrijver, Alexander Geometric algorithms and combinatorial optimization. 2. corr. ed. (English) Zbl 0837.05001 Algorithms and Combinatorics. 2. Berlin: Springer-Verlag. xii, 362 p. (1993). 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. For the first edition in 1988 see Zbl 0634.05001. Cited in 3 ReviewsCited in 203 Documents MSC: 90-02 Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming 05-02 Research exposition (monographs, survey articles) pertaining to combinatorics 90C27 Combinatorial optimization 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut 90C60 Abstract computational complexity for mathematical programming problems 05C85 Graph algorithms (graph-theoretic aspects) 52B55 Computational aspects related to convexity 68Q25 Analysis of algorithms and problem complexity 90C05 Linear programming 05B35 Combinatorial aspects of matroids and geometric lattices Keywords:geometric algorithms; combinatorial optimization PDF BibTeX XML Cite \textit{M. Grötschel} et al., Geometric algorithms and combinatorial optimization. 2. corr. ed. Berlin: Springer-Verlag (1993; Zbl 0837.05001) Full Text: EuDML