A Parallel Branch-and-Cut Framework
Branch-and-Cut (B&C) algorithms are a promising approach for solving NP-hard combinatorial optimization problems. The aim of this joint project with the department Optimization is to provide a generic framework that supports the developement of parallel B&C algorithms. The target architecture is the Cray Reseach T3D MPP. Further information is available in the detailed project description.
Martin Zaun, née Grammel
Cray Research Inc.
1992 - 1996