DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 1995; 441 pp; hardcover Volume: 20 ISBN10: 0821802399 ISBN13: 9780821802397 List Price: US$125 Member Price: US$100 Order Code: DIMACS/20
 This book grew out of the fourth Special Year at DIMACS, which was devoted to the subject of combinatorial optimization. During the special year, a number of workshops, small and large, dealt with various aspects of this theme. Organizers of the workshops and selected participants were asked to write surveys about the hottest results and ideas in their fields. Therefore, this book is not a set of conference proceedings but rather a carefully refereed collection of invited survey articles written by outstanding researchers. Aimed at researchers in discrete mathematics, operations research, and the theory of computing, this book offers an indepth look at many topics not treated in textbooks. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Readership Researchers and graduate students in discrete mathematics, operations research, and the theory of computing. Table of Contents  M. Deza, V. P. Grishukhin, and M. Laurent  Hypermetrics in geometry of numbers
 M. Jünger, G. Reinelt, and S. Thienel  Practical problem solving with cutting plane algorithms in combinatorial optimization
 L. Lovász  Randomized algorithms in combinatorial optimization
 S. Poljak and Z. Tuza  Maximum cuts and largest bipartite subgraphs
 Y. Pochet and L. A. Wolsey  Algorithms and reformulations for lot sizing problems
 H. RipphausenLipa, D. Wagner, and K. Weihe  Efficient algorithms for disjoint paths in planar graphs
 D. B. Shmoys  Computing nearoptimal solutions to combinatorial optimization problems
 G. Simonyi  Graph entropy: A survey
