The NEOS Server offers SYMPHONY for the solution of
mixed integer linearly constrained optimization problems (MILPs) in
SYMPHONY solves MILPs using the branch-and-cut algorithm.
Additional details and options are available in the
online user manual.
SYMPHONY is developed and maintained by
Ted Ralphs and others. Visit the
SYMPHONY page at COIN-OR
for more details.