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

Front Cover
William J. Cook, Andreas S. Schulz
Springer, Jun 20, 2002 - Computers - 487 pages
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.

From inside the book

What people are saying - Write a review

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

Contents

A Faster Scaling Algorithm for Minimizing Submodular Functions
1
A Coordinatewise Domain Scaling Algorithm
21
The Quickest Multicommodity Flow Problem
36
Copyright

22 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information