New Titles  |  FAQ  |  Keep Informed  |  Review Cart  |  Contact Us Quick Search (Advanced Search ) Browse by Subject General Interest Logic & Foundations Number Theory Algebra & Algebraic Geometry Discrete Math & Combinatorics Analysis Differential Equations Geometry & Topology Probability & Statistics Applications Mathematical Physics Math Education
Combinatorial Optimization
Edited by: William Cook, Rice University, Houston, TX, László Lovász, Yale University, New Haven, CT, and Paul Seymour, Bellcore, Morristown, NJ
A co-publication of the AMS and DIMACS.
 SEARCH THIS BOOK:
DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
1995; 441 pp; hardcover
Volume: 20
ISBN-10: 0-8218-0239-9
ISBN-13: 978-0-8218-0239-7
List Price: US$119 Member Price: US$95.20
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 in-depth look at many topics not treated in textbooks.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).

Researchers and graduate students in discrete mathematics, operations research, and the theory of computing.

• 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. Ripphausen-Lipa, D. Wagner, and K. Weihe -- Efficient algorithms for disjoint paths in planar graphs
• D. B. Shmoys -- Computing near-optimal solutions to combinatorial optimization problems
• G. Simonyi -- Graph entropy: A survey