Combinatorial Optimization: Papers from the DIMACS Special Year

Front Cover
William Cook, László Lovász, Paul D. Seymour
American Mathematical Soc., Jan 1, 1995 - Mathematics - 441 pages
2 Reviews
This is 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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Practical problem solving with cutting plane algorithms
111
Michael Junger Gerhard Reinelt and Stefan Thienel
153
Maximum cuts and largest bipartite subgraphs
181
Algorithms and reformulations for lot sizing problems
245
Efficient algorithms for disjoint paths in planar graphs
295
Computing nearoptimal solutions to combinatorial optimization problems
355
A survey
399
Copyright

Common terms and phrases

Bibliographic information