Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Combinatorial Optimization
 
Edited by: William Cook Rice University, Houston, TX
László Lovász Yale University, New Haven, CT
Paul Seymour Bellcore, Morristown, NJ
A co-publication of the AMS and DIMACS
Combinatorial Optimization
Hardcover ISBN:  978-0-8218-0239-7
Product Code:  DIMACS/20
List Price: $140.00
MAA Member Price: $126.00
AMS Member Price: $112.00
eBook ISBN:  978-1-4704-3978-1
Product Code:  DIMACS/20.E
List Price: $132.00
MAA Member Price: $118.80
AMS Member Price: $105.60
Hardcover ISBN:  978-0-8218-0239-7
eBook: ISBN:  978-1-4704-3978-1
Product Code:  DIMACS/20.B
List Price: $272.00 $206.00
MAA Member Price: $244.80 $185.40
AMS Member Price: $217.60 $164.80
Combinatorial Optimization
Click above image for expanded view
Combinatorial Optimization
Edited by: William Cook Rice University, Houston, TX
László Lovász Yale University, New Haven, CT
Paul Seymour Bellcore, Morristown, NJ
A co-publication of the AMS and DIMACS
Hardcover ISBN:  978-0-8218-0239-7
Product Code:  DIMACS/20
List Price: $140.00
MAA Member Price: $126.00
AMS Member Price: $112.00
eBook ISBN:  978-1-4704-3978-1
Product Code:  DIMACS/20.E
List Price: $132.00
MAA Member Price: $118.80
AMS Member Price: $105.60
Hardcover ISBN:  978-0-8218-0239-7
eBook ISBN:  978-1-4704-3978-1
Product Code:  DIMACS/20.B
List Price: $272.00 $206.00
MAA Member Price: $244.80 $185.40
AMS Member Price: $217.60 $164.80
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 201995; 441 pp
    MSC: Primary 90; Secondary 05

    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).

    Readership

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

  • Table of Contents
     
     
    • Chapters
    • Hypermetrics in geometry of numbers
    • Practical problem solving with cutting plane algorithms in combinatorial optimization
    • Randomized algorithms in combinatorial optimization
    • Maximum cuts and large bipartite subgraphs
    • Algorithms and reformulations for lot sizing problems
    • Efficient algorithms for disjoint paths in planar graphs
    • Computing near-optimal solutions to combinatorial optimization problems
    • Graph entropy: A survey
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
Volume: 201995; 441 pp
MSC: Primary 90; Secondary 05

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).

Readership

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

  • Chapters
  • Hypermetrics in geometry of numbers
  • Practical problem solving with cutting plane algorithms in combinatorial optimization
  • Randomized algorithms in combinatorial optimization
  • Maximum cuts and large bipartite subgraphs
  • Algorithms and reformulations for lot sizing problems
  • Efficient algorithms for disjoint paths in planar graphs
  • Computing near-optimal solutions to combinatorial optimization problems
  • Graph entropy: A survey
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.