SAL Home NUMERICS Optimization


SYMPHONY (Single- or Multi-Process Optimization over Networks) is a fully parallel, generic implementation of the branch, cut, and price algorithm for solving integer and mixed-integer programs. The user of the library need only supply model-specific preprocessing and separation functions to implement a state-of-the-art branch and cut algorithm for virtually any problem setting. The remaining components of the branch and cut framework, e.g., search tree management, management of linear programming solution, cut pool management, and communication management, are entirely internal to the library. The executables can be built in any number of configurations ranging from completely sequential to fully parallel with independently functioning cut generators, cut pools, and LP solvers. The distributed version currently runs in any environment supported by the PVM message passing protocol. The same source code can also be compiled for shared-memory architectures using any OpenMP compliant compiler.

Current Version:   ??

License Type:   Personal User License

Home Site:

Source Code Availability:


Available Binary Packages:

  • Debian Package: No
  • RedHat RPM Package: No
  • Other Packages: No

Targeted Platforms:

sequential to cluster or shared-memory architectures

Software/Hardware Requirements:

C compiler

Other Links:

Mailing Lists/USENET News Groups:


User Comments:

  • None

See A Screen Shot? (Not Yet)

  SAL Home   |   Numerical Analysis   |   Optimization

Comments? SAL@KachinaTech.COM
Copyright © 1995-2001 by Herng-Jeng Jou
Copyright © 1997-2001 by Kachina Technologies, Inc.
All rights reserved.