Nemhauser, George L.; Wolsey, Laurence A. Integer and combinatorial optimization. Paperback ed. (English) Zbl 0944.90001 Wiley-Interscience Series in Discrete Mathematics and Optimization. New York, NY: Wiley. xiv, 763 p. (1999). This book is a paperback edition of the volume (1988; Zbl 0652.90067) whose review was very positive. Reviewer: A.Akutowicz (Berlin) Cited in 309 Documents MSC: 90-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming 90C10 Integer programming 90C27 Combinatorial optimization 90B10 Deterministic network models in operations research 52Bxx Polytopes and polyhedra 05B35 Combinatorial aspects of matroids and geometric lattices 90C35 Programming involving graphs or networks 90C05 Linear programming 68Q25 Analysis of algorithms and problem complexity 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) Keywords:discrete optimization; computational complexity; polynomial-time algorithms; valid inequalities; facets; basis reduction; separation; duality; matching; relaxation; submodular function Citations:Zbl 0652.90067 × Cite Format Result Cite Review PDF