Lawler, Eugene L. Combinatorial optimization: Networks and matroids. (English) Zbl 0413.90040 New York etc.: Holt, Rinehart and Winston. X, 374 p. (1976). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 11 ReviewsCited in 489 Documents MSC: 90C35 Programming involving graphs or networks 90-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming 05B35 Combinatorial aspects of matroids and geometric lattices 05C35 Extremal problems in graph theory 68Q25 Analysis of algorithms and problem complexity 05-02 Research exposition (monographs, survey articles) pertaining to combinatorics 90C10 Integer programming 68R10 Graph theory (including graph drawing) in computer science 90B10 Deterministic network models in operations research Keywords:matroids; matroid intersection algorithm; combinatorial optimization; augmenting paths; network flow algorithms; out-of-kilter algorithm; Np- hard problems; network programming; integer programming; polynomially bounded algorithms; computational complexity; bipartite and nonbipartite networks; matroid greedy algorithm PDFBibTeX XML