The NEOS Server offers SYMPHONY for the solution of mixed-integer linearly
constrained optimization problems (MILPs) in MPS format.
SYMPHONY solves MILPs using the branch-and-cut algorithm.
SYMPHONY was developed and is maintained by Ted Ralphs and others.
Additional details and options are available in the
online user manual
and the SYMPHONY page at
The user must submit a model in
to solve an MILP.