Misc Books 1. Higher Arithmetic: An algorithmic introduction to Number Theory 2. A Conscise introduction to Data Compression by Salomon. 3. Putting Auction Theory to Work by Paul Milgrom. 4. Di erence Equations: From Rabbits to Chaos by Cull, Flahive, and Robson. 5. Dissemination of Information in Optical Networks By Bandyopadhyay. Review 1 of Combinatorial Optimization: Packing and Covering Author of Book: by G rard Cornu jols e e SIAM, 2001, 132 pages Review written by Brian Borcher This book is based on a series of ten lectures given by Cornu jols at a CBMS NSF regional e conference in 1999. It is a monograph on the polyhedral combinatorics of packing and covering problems. The fundamental approach is to formulate a combinatorial optimization problem as an integer linear programming problem and then determine conditions under which the feasible region of the linear programming (LP) relaxation of the problem has integral vertices. In such cases, the problem can be solved e ciently by simply solving the LP relaxation. For example, the weighted vertex cover problem can be formulated as an integer programming problem min wx Mx ¥ 1 x ¥ 0 x integer. Here, M is a 0 1
/lp/association-for-computing-machinery/review-of-combinatorial-optimization-packing-and-covering-y5YVyAqCNj