Integer Programming and Combinatorial Optimization: 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

This book constitutes the refereed proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002, held in Cambridge, MA, USA, in May 2002. The 33 revised full papers presented were carefully reviewed and selected from a total of 110 submissions. Among the topics covered are scaling algorithms, flow algorithms, combinatorial optimization algorithms, approximate TSP solutions, graph computations, algorithmic geometry, mixed integer programming, network design, logistic scheduling, constraint solving, resource allocation, matching algorithms, and matroid intersection algorithms.