Integer Programming and Combinatorial Optimization: 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. 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 reviewed proceedings of the 8th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2001, held in Utrecht, The Netherlands in June 2001. The 32 revised full papers presented were carefully reviewed and selected from a total of 108 submissions. The proceedings reflect most current directions in integer programming and optimization research. Among the topics covered are approximation algorithms, branch and bound algorithms, computational biology, computational complexity, algorithmic geometry, cutting plane algorithms, diophantine equations, geometry of members, graph and network algorithms, online algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semidefinite programs.