To order through AMS contact the AMS Customer Services Department, P.O. Box 6248, Providence, Rhode Island 02940-6248 USA. For Visa, Mastercard, Discover, and American Express orders call 1-800-321-4AMS.
You may also visit the AMS Bookstore and order directly from there. DIMACS does not distribute or sell these books.
It seemed to us that the best way to document this activity is not by editing proceedings of selected workshops, but by asking organizers and/or participants to write surveys on those topics they felt were the most central or most exciting. The response was very positive and resulted in the survey articles collected in this volume.
|Hypermetrics in geometry of numbers
M.Deza, V.P. Grishukhin, M. Laurent
|Practical problem solving with cutting plane algorithms in combinatorial
Michael Junger, Gerhard Reinelt, Stefan Thienel
|Randomized algorithms in combinatorial optimization
|Maximum cuts and largest bipartite subgraphs
Svatopluk Poljak, Zsolt Tuza
|Algorithms and reformulations for lot sizing problems
Yves Pochet, Laurence A. Wolsey
|Efficient algorithms for disjoint paths in planar graphs
Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
|Computing near-optimal solutions to combinatorial optimization problems
David B. Shmoys
|Graph entropy: A survey